Perfect hash function (nonfiction)

From Gnomon Chronicles
Revision as of 18:39, 6 December 2017 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In computer science, a perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. In mathematical terms, it is an injective function.

Perfect hash functions may be used to implement a lookup table with constant worst-case access time.

A perfect hash function has many of the same applications as other hash functions, but with the advantage that no collision resolution has to be implemented.

In the News

Fiction cross-reference

Nonfiction cross-reference

External links: