16. Hash Tables

This section focuses on alternatives to tree-like associative data structures – hash tables.

• 16.1. Hashing concepts
• 16.2. Hash functions
  • 16.2.1. Integer hashes
  • 16.2.2. String hashes
  • 16.2.3. Hashing user defined types
• 16.3. Resolving collisions
• 16.4. Open hashing
• 16.5. Analysis of separate chaining
• 16.6. Closed hashing
  • 16.6.1. Choosing the next slot
  • 16.6.2. Analysis of closed hashing
• 16.7. Analysis of hash tables