April 6, 2011 in binary search
You are browsing the archive for binary search.
January 27, 2011 in binary search
Given two sorted arrays A, B of size m and n respectively. Find the k-th smallest element in the union of A and B. You can assume that there are no duplicate elements.