华南理工大学数据结构chapter9.pptVIP

* * * * * * * * * * * * * * * Hashing is not good for range queries. * * * * * * * * * * * * * * For (a): prob(3) = 4/11, prob(4) = 1/11, prob(5) = 1/11, prob(6) = 1/11, prob(10) = 4/11. For(b): prob(3) = 8/11, prob(4,5,6) = 1/11 each. * If M=10 and c=2, then we effectively have created 2 hash tables (evens vs. odds). * * Probe sequence for k1: 30, 31, 34, 39. Probe sequence for k2: 29, 30, 33, 38. * * Probe sequence for k1: 30, 32, 34, 36. Probe sequence for k2: 28, 33, 38,43. Probe sequence for k3: 30, 35, 40, 45. * * * * * * * * * Quadratic Probing Set the i’th value in the probe sequenc