Linear Probing

Given an ordinary hash function h(k): h(k,i) = (h(k) + i) mod m.

Sequence:

h(k)

h(k) + 1

h(k) + 2

...

m-1

0

1

2

...

h(k) - 1

There are only m (<<m!) possible sequences, but these are simple to compute.