Question: Suppose that you have two sorted numerical arrays A[1 ... m] and B(1 ... n). You want to compute the kth smallest number in the
![Suppose that you have two sorted numerical arrays A[1 ... m]](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f2d60e145ad_54166f2d60daae86.jpg)
Suppose that you have two sorted numerical arrays A[1 ... m] and B(1 ... n). You want to compute the kth smallest number in the merged array of all m + n elements. Please design a divide- and-conquer algorithm that can do so in O(log(m + n)). You can assume for simplicity that k is even
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
