Question

You are given two arrays a1 and a2, each with n elements sorted in increasing order. For simplicity, you may assume that the keys are all distinct from each other. Describe an o(log n) time algorithm to find the n/2 th smallest of all the 2n keys in a1 and a2 assuming that n is even.

Answer 1

For simplicity, you may assume that the keys are all distinct from each other. Describe an o(log n) time algorithm to find the (n/2) th smallest of the 2n keys assuming ...