@kunal.. +1 @dave ... for min heap.. read my statement again... kth largest would be (n-k+1)th smallest... @others ... randomized- partioning.. will not assure of finding an element..in O(n).... for finding median ... we can be assure... that... O(n).. proof given in the cormenn....
With regards, Praveen Raj DCE-IT 3rd yr -- 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.