Linear probing
When searching for K, check locations h(K), h(K)+1, h(K)+2, … until either
- K is found; or
- we find an empty location (K not present)
If table is very sparse, almost like separate chaining.
When table starts filling, we get clustering but still constant average search time.
Full table ? infinite loop.