Linear Probing

• $h'(k,i) = (h(k) + i) \bmod m$.
• That is... take an ordinary hash function, than start scanning forward (with wrap around) for an empty spot.
• Simple!
• Prone to clumping (primary clustering).