Robin Hood Hash Displacement
Move crowded keys aside by comparing their probe distances.
Free theory articleMove crowded keys aside by comparing their probe distances.
Concept & interpretation
Robin Hood hashing is a variation of open addressing with linear probing that aims to reduce the maximum search time by distributing displacement more fairly among elements.
Experiment
You can interact with the Robin Hood Hash Displacement module.
- Set Keys to
Wrap. - Set Capacity to
7. - Set Query key to
-1.
Observe the physical array layout mapping. The negative key -1 evaluates to ((-1 mod 7) + 7) mod 7 = 6.