[algogeeks] Re: Finding median in theta(n^lg3) time

[Vijendra Singh]

Yeah, I think the select algorithm which is based on quick sort is the way to go.

-Vijju

On 10/25/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:

binary search will not work in case the array is unsorted..otherwise
use it.

--~--~---------~--~----~------------~-------~--~----~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---