On May 21, 7:17 am, Bharath <bharath1...@gmail.com> wrote: > Find the median of the values and move the lower values to left and higher > values to the right. This can be done in o(n). now do the same on both the > parts recursively. And the total complexity will be o(nlogk). > Further to my previous post, one question. Can the median be found in O(n) time without using extra memory? I am not familiar with the algorithms that find the median though I know the median can be found in O(n) time.
Regards, Ralph -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
