With separate chaining, keys that map to bucket two share that bucket; with linear probing, a later free slot is searched.
Read the related guide · · Bookmark this unique URL with Ctrl/Cmd+D.
A collision occurs when distinct keys map to the same hash-table slot, so a table needs a collision-resolution strategy. Experiment with a small example and see each step update.
With separate chaining, keys that map to bucket two share that bucket; with linear probing, a later free slot is searched.
Read the related guide · · Bookmark this unique URL with Ctrl/Cmd+D.