The Painter’s Partition Problem Part II
April 6, 2011 in binary search
Note:
This is Part II of the article: The Painter’s Partition Problem. Please read Part I for more background information.
Read the rest of this entry →
You are browsing the archive for binary search.
by 1337c0d3r
by 1337c0d3r
Find the k-th Smallest Element in the Union of Two Sorted Arrays
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.
by 1337c0d3r
Finding intersection of two sorted arrays
March 12, 2010 in binary search
Find the intersection of two sorted arrays.