sorry people my explanation was incomplete. give time i will pass one the complete code. Thank you, Siddharam
On Sat, Aug 6, 2011 at 3:52 PM, siddharam suresh <siddharam....@gmail.com>wrote: > 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 <rajkumar.cs...@gmail.com>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, >> 10it60...@iitkgp.ac.in >> 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 algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
