Double Hashing

• You first hash function h1(key) computes the basic address.

• You then define a second hash function h2(key) that computes the size of probing steps to take.

• h2(key) must have the following properties:

  • h2(key) ≠ 0 [step size can’t be zero]
  • h2 ≠h1