Perfect hash functions are hash functions which guarantee O(1) operations complexity when used in a hash table; In other words, ...
[edit] Perfect hash function
If all keys are known ahead of time, a perfect hash function can be used to create a perfect hash table that has no collisions. If minimal perfect hashing is used, every location in the hash table can be used as well.
  
|
RSS
