Indexing
Hashing your keys…
Initializing Sorting Algorithms...
Sorting
Trees
Graphs
Preparing interactive visualizations...
Indexing
Hashing your keys…
Separate chaining: each slot owns a list, so a collision extends a chain instead of hunting for free space.
Also called separate chaining. The older name "open hashing" means keys may live outside the table array — not to be confused with "open addressing", which is the opposite approach.
Click Play to begin
O(1)O(1 + α)O(n)O(n + m)Question 1 of 3
In an "open hash table", where do colliding keys actually live?