A
hash table is an efficient data structure for
implementing
dictionary operations.
This presentation is organized as follows:
- Dynamic Sets: The motivation for data
structures that implement dictionary operations
- Direct Addressing: The easiest, but most
impractical, way of accessing data in a set
- Hash Functions: Transforming keys to array indexes
- Handling Collisions: When keys collide
- Hash Table Operations: Dictionary operations
on hash tables
- Hash Function Performance: Writing
good hash functions