Double hashing

• When searching for K, check locations h1(K), h1(K)+ h2(K), h1(K)+2*h2(K),… until either

  • K is found; or
  • we find an empty location (K not present)

• Must be careful about h2(K)

  • Not 0.
  • Not a divisor of M.

• Almost as good as random probing.

• Very difficult analysis.

Previous slide

Next slide

Back to first slide

View graphic version