consider x[1, ..., n] and y[1, ..., n] be two arrays each containing n-numbers both of which are already sorted. what is the time complexity to find median by combining the two array if we use merge procedure....?
actually it is O(n)
but i want to know is it due to 2n-1 comparisions???