Open addressing
No links, all keys are in the table.
When searching for K, check locations r1(K), r2(K), r3(K), … until either
- K is found; or
- we find an empty location (K not present)
Various flavors of open addressing differ in which probe sequence they use.
Random probing -- each ri is random. (Impractical)