a[1....n] b[1...m] find median of two array say n1 and m1..if n1>m1 then median of both array can't be in in region a[n1..n] and b[1...m1]....so now search space is reduced ..and we continue like this untill we find median.
On Thu, Aug 5, 2010 at 6:37 AM, AlgoBoy <[email protected]> wrote: > find the median of two sorted arrays..which have unequal lengths... > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
