Probing strategies Double hashing Given two ordinary hash functions h, (h) and h2(k) double hashing uses the hash function h(h, i)=(h,()+ih,(h)mod m This method generally produces excellent results but h,(h) must be relatively prime to m. One way is to make m a power of 2 and design h,(k)to produce only odd numbers o 2001 by Charles E Leiserson Introduction to Algorithms Day 11 L7.20© 2001 by Charles E. Leiserson Introduction to Algorithms Day 11 L7.20 Probing strategies Double hashing Given two ordinary hash functions h1(k) and h2(k), double hashing uses the hash function h(k,i) = (h1(k) + i⋅h2(k)) mod m. This method generally produces excellent results, but h2(k) must be relatively prime to m. One way is to make m a power of 2 and design h2(k) to produce only odd numbers