[algogeeks] Re: Sorting o(n) time

2007-03-16 Thread Rajiv Mathews

On 3/16/07, Karthik Singaram L [EMAIL PROTECTED] wrote:

 How would the median algorithm get the top k elements?


I think what he meant was, use the median by parting-in-5 algorithm to
find the kth largest element. This can be done in O(n).
Then just partition around this element to get the top k elements, O(n).

-- 


Regards,
Rajiv Mathews

--~--~-~--~~~---~--~~
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.google.com/group/algogeeks
-~--~~~~--~~--~--~---



[algogeeks] Hashing

2007-03-16 Thread vijay bhaskar
 i like to learn about hashes.
how to hashing and using Hash Keys, Universal Hashing in C++
plesae guide me about this.

Thanks in Advance
Vijay bhaskar R

--~--~-~--~~~---~--~~
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.google.com/group/algogeeks
-~--~~~~--~~--~--~---



[algogeeks] Re: Hashing

2007-03-16 Thread Dhruva Sagar
which hashing algorithm would you like to know in particular?
There are several hashing algorithms available for c++, you may simnply
search for the libraries and look at the API.


On 3/16/07, vijay bhaskar [EMAIL PROTECTED] wrote:

  i like to learn about hashes.
 how to hashing and using Hash Keys, Universal Hashing in C++
 plesae guide me about this.

 Thanks in Advance
 Vijay bhaskar R



 



-- 
If you reached till here,
you must have read my mail, hope you liked it.

Thanks  Regards,
Dhruva Sagar.
Application Programmer @ IBM India Pvt. Ltd. @ Bangalore
Contact Ph. No. :
   Direct  : +91-80-4195-4178 (Extn 4178)
   Mobile : +91-9900416065

Y! IM  : [EMAIL PROTECTED]
GTalk : [EMAIL PROTECTED]

--~--~-~--~~~---~--~~
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.google.com/group/algogeeks
-~--~~~~--~~--~--~---