Lingo

Hash Table Playground

Insert keys and watch the hash function scatter them across buckets.

Operations

The hash decides the bucket; collisions are resolved by chaining, so lookups stay O(1) on average.

h(k) = 0
·
h(k) = 1
·
h(k) = 2
·
h(k) = 3
·
h(k) = 4
·
h(k) = 5
·
h(k) = 6
·
h(k) = 7
·
h(k) = 8
·
h(k) = 9
·
h(k) = 10
·

Insert a key to fill the table.

0Keys
11Buckets
0.00Load factor
0Collisions