Home▸Computer Science▸Robin Hood Hashing Versus Linear Probing: Displacement at High Load (2D)

Robin Hood Hashing Versus Linear Probing: Displacement at High Load (2D)

Two circular hash tables filled with the same keys, coloured by displacement from the home slot, with a per-slot displacement bar chart. The same shared model as the 3D scene: load factor, Knuth probe counts, variance and numerical checks.

Computer Science2DModerate60 FPS📱 Mobile-adapted🟠 Blender⇄ 3D version
Robin Hood Hashing Versus Linear Probing: Displacement at High Load (2D) ↗ Open standalone

Feed the same random keys into two circular hash tables, one using plain linear probing and one using Robin Hood hashing. See how clusters grow as the load factor rises, why the mean probe count is identical, and how Robin Hood keeps every key close to home while linear probing leaves a long unlucky tail. Blender-built turntables and key hopper, with Knuth formulas and numerical checks built in.

⚙ Under the hood

Two circular hash tables filled with the same keys, coloured by displacement from the home slot, with a per-slot displacement bar chart. The same shared model as the 3D scene: load factor, Knuth probe counts, variance and numerical checks.

Hash TableRobin Hood HashingLinear ProbingData StructuresAlgorithms

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)