Given two sorted lists, each containing n real numbers. Is there a O(lg n) time algorithm to compute the element of rank i(well i corespond to index in increasing order) in the union of the two lists assuming the elements of the two lists are distinc
O(log n) algorithm to find the element having rank i in union of pre-sorted lists