Given two individually sorted lists A1n and B1n describe the

Given two (individually) sorted lists A[1..n] and B[1..n], describe the median-finding algorithm for A+B (i.e. the combined list) with pseudo-code. Identify the recurrence and the time-complexity. Select (L, K)

Solution

Time complexity is changes based on the sorting algorithm implemented and by comparing the elements we can sort and combine those two arrays with O(logn)

Hence the time complexity involved in finding the median element of the combined array of two sorted arrays...