> 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. >
This is important! I don't see how the standard algorithm for median finding can be tweaked to use only constant extra space. @Bharath: It's a nice algorithm, nevertheless :) -Jagadish http://www.cse.iitb.ac.in/~jagadish -- 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.
