[cap-talk] Hashtable costs
David-Sarah Hopwood
david.hopwood at industrial-designers.co.uk
Thu Apr 2 14:40:39 EDT 2009
Bill Frantz wrote:
> All of the hash tables I have used have been designed to have more than one
> entry/chain head. These tables are designed to incur an O(n) cost. Is there
> an example of a real-world O(1) hash table? It would have to have a
> guarantee that no chain was more than one element long.
<http://en.wikipedia.org/wiki/Perfect_hashing>
<http://en.wikipedia.org/wiki/Cuckoo_hashing>
--
David-Sarah Hopwood ⚥
More information about the cap-talk
mailing list