Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Hashing 101: the Fundamentals
1.1. The Ideal: Perfect Hash Functions
1.2. The Reality: Collisions
2. Hash Functions
3. Hash Functions: Examples
3.1. Hashing Integers
3.2. Hashing Character Strings
3.3. Hashing Compound Structures

Hashing is an important approach to set/map construction.

We've seen sets and maps with O(N) and O(log N) search and insert operations.

Hash tables trade off space for speed, sometimes achieving O(1) search and insert times.

In the Forum:

(no threads at this time)