Question: Given A[n] and B[n] as two sorted array in increasing order. Suppose all numbers are distinct. Find the median of the 2n numbers in O(log
![Given A[n] and B[n] as two sorted array in increasing order.](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3ba53a27fa_97966f3ba5341941.jpg)
Given A[n] and B[n] as two sorted array in increasing order. Suppose all numbers are distinct. Find the median of the 2n numbers in O(log n) time. Write down your algorithm and show the running time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
