Double Hashing

overview

Remember these Terms

• Hash table: array storing key-value pairs by index.
• Hash function: maps a key to an array index.
• Double hashing: uses two hash functions to resolve collisions.
• Collision: two keys produce the same index.
• Primary hash h1: starting index for a key.
• Secondary hash h2: step size used for probing.
• Probe sequence: ordered indices checked to find a slot.
• Load factor: filled slots divided by table size.
• Tombstone: marker kept after deletion to preserve searches.