It takes $O(n)$ time to find the median in a list of $n$ elements, which are not necessarily in sorted order while it takes only $O(1)$ time to find the median in a list of $n$ sorted elements. How much time does it take to find the median of $2n$ elements which are given as two lists of $n$ sorted elements each?
Similar question: https://gateoverflow.in/302811/gate2019-37
http://www.geeksforgeeks.org/median-of-two-sorted-arrays/
Correct Answer: $B$
Answer is D
64.3k questions
77.9k answers
244k comments
80.0k users