Given 2 sorted int arrays of size N each, you have to find the median of elements present in these 2 arrays.
this can be done in linear time by traversing the array and updating median 1 and median 2
and stopping when count = n+1
m assuming two arrays of equal size n
There are currently 1 users browsing this thread. (0 members and 1 guests)
Bookmarks