Probing strategies near probings Given an ordinary hash function h'(k), linear probing uses the hash function h(h, i)=(h (k)+i) mod m This method, though simple, suffers from primar clustering, where long runs of occupied slots build ,Increasing the average search time oreover the long runs of occupied slots tend to get longer o 2001 by Charles E Leiserson Introduction to Algorithms Day 11 L7. 19© 2001 by Charles E. Leiserson Introduction to Algorithms Day 11 L7.19 Probing strategies Linear probing: Given an ordinary hash function h′(k), linear probing uses the hash function h(k,i) = (h′(k) + i) mod m. This method, though simple, suffers from primary clustering, where long runs of occupied slots build up, increasing the average search time. Moreover, the long runs of occupied slots tend to get longer