Cuckoo Hashing — visual-cs

Key (integer)

Table size: 8

Speed: 5

Table 1 (h₁)

Table 2 (h₂)

Legend

Table 1 slot (occupied)

Table 2 slot (occupied)

Eviction chain

Hit / Inserted

Miss / Deleted

Checking

Statistics

Load Factor

Insertions

Eviction Chains

Max Chain Len

Rehashes

Total Keys

Hash Functions

h₁(x) = x mod 8

h₂(x) = floor(x / 8) mod 8

Step Log

Ready. Enter a key and choose an operation.

How It Works

Cuckoo Hashing uses two hash tables with two hash functions. Each key has exactly two possible locations: T1[h₁(key)] and T2[h₂(key)].

Insert: Place key in T1. If occupied, evict the resident to its alternate table. This "cuckoo" displacement chains until an empty slot is found or a cycle is detected (triggering a rehash).

Lookup: Check both locations -- always O(1), just 2 probes.

Delete: Check both locations, remove if found -- O(1).