[algogeeks] Median Finding in Sorted Arrays

Hi guys, Please help me in finding median of two sorted arrays of length m and n in minimum possible time. Thanks, Sanjay -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send

[algogeeks] Re: Median Finding in Sorted Arrays

Use a binary search. Assume that you have arrays a[m] and b[n] sorted in ascending order. If a[i] is the kth smallest element, then b[k-i-2] must be smaller than a[i], and b[k-i-1] must be larger (assuming arrays are zero-based). After using a binary search to find the value of i to meet this

Re: [algogeeks] Book - COMPETITIVE PROGRAMMING - Increasing the Lower Bound of Programming Contests

Hi, Do you have a copy of competitive programming 2? Please share Regards, Piyush On Wed, Aug 24, 2011 at 7:24 AM, Cleber Adriani da Costa cleberadri...@gmail.com wrote: Hi guys, anyone have the link of the book COMPETITIVE PROGRAMMING *Increasing the Lower Bound of Programming