Mathematics · Data Structures and Algorithms

Let double hashing use a hash function of the form: h(k, i) = [h1(k) + i · h2(k)] mod m where h1(k) = k mod m and h2(k) = 1 + (k mod m1). If m = 701, m1 = 700, and key k = 124858, the first probe is to position 80, and then every ......... slot is examined until the key is found or every slot is examined.