perfect hash function

A hash function that sends every key in a known, fixed set to a different slot, so there are no collisions at all.

In more detail

With a perfect hash, every lookup is exactly one probe. It is only possible when all keys are known in advance, as for a language's reserved words. The course uses it as the ideal against which a constant hash, the opposite extreme, is compared.

Related terms

Taught in

References