Understanding why open-addressing hash tables degrade sharply as the load factor approaches one.
In an open-addressing hash table using linear probing, why does performance degrade catastrophically as the load factor α approaches 1.0, far worse than in separate chaining?