Question

let x[m] and y[n] be two sorted arrays containing m and n elements . give an o(log min(m,n)) time algorithm to find the median of m+n elements

Answer 1

let x[m] and y[n] be two sorted arrays containing m and n elements . give an o(log min(m,n)) time algorithm to find the median of m+n elements