Chapter 4 · Simulation
Hash and Interpolation Search
Hash table search h(k) = k mod 8
Chaining: each bucket holds a list of keys.
Interpolation search sorted array
pos = lo + ⌊(x − A[lo]) · (hi − lo) / (A[hi] − A[lo])⌋
Chapter 4 · Simulation
Chaining: each bucket holds a list of keys.
pos = lo + ⌊(x − A[lo]) · (hi − lo) / (A[hi] − A[lo])⌋