Probing
Probing how to:
- First probe - given a key k, hash to h(k)
- Second probe - if h(k) is occupied, try h(k) + f(1)
- Third probe - if h(k) + f(1) is occupied, try h(k) + f(2)
- And so forth
Probing properties
- we force f(0) = 0
- the ith probe is to (h(k) + f(i)) mod size
- if i reaches size - 1, the probe has failed
- depending on f(), the probe may fail sooner
- long sequences of probes are costly!