take the median of both the array MX, MY. (MX+1 means next element to MX in array X. lly to MY+1) recursively search till you get (MX< MY< MX+1) (then return MY) or (MY<MX<MY+1)(then return MX).
Thank you, Siddharam On Sat, Aug 6, 2011 at 3:45 PM, kumar raja <[email protected]> wrote: > X,Y are two sorted arrays of length 'n'. > > how to find the median( n th smallest element) in this total 2n elements in > O(log n) time??/ > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > [email protected] > 7797137043. > 09491690115. > > -- > 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. > -- 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.
