Linear probing (left) vs Robin Hood (right), colour = displacement
Displacement of every slot

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

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.

Made with 🟠 Blender