Can a hash function be said to be in the worst case?

A perfect hash function will result in worst case lookup. Moreover, if the maximum number of collisions possible is , then hash table lookup can be said to be in the worst case. If the expected number of collisions is , then the hash table lookup can be said to be in the average case. A perfect hash function would be perfect, but how do I get one?
For More Information Please Refer:


You May Also Like to Read: