Linear Hashing Visualizer

Buckets hold 3 records. Watch how level i, split pointer n, and buckets evolve as you insert keys.

Controls 🔧 interactive

or custom:
Bucket choice uses hi(k) = k mod 2i, then maybe hi+1 if the bucket index is < n.
Level i
1
Split pointer n
0
Buckets
2
Total records
0
Occupancy
0.00
Threshold
0.75
Insert history (decimal → binary):

Buckets 🪣 primary + overflow

Each bucket holds up to 3 records in its primary block. Extra records are drawn as overflow. The bucket with border glow is the next one that will be split.