Hashing

Open Addressing

Collision handling decides what happens when multiple keys map to the same bucket.

Kind

linear

Time

O(1) expected

Space

O(N)

Steps

Input Keys

[0]

[1]

[2]

[3]

[4]

[5]

[6]

Hash Table / State

bucket 0

empty

bucket 1

empty

bucket 2

empty

bucket 3

empty

bucket 4

empty

bucket 5

empty

bucket 6

empty

Step Timeline

Code + Variables

1index = hash(key) % m

2while table[index] is full

3    index = (index + 1) % m

4insert key at free slot

tableSize7

Loading Lab...