A hash table of size m is used to store n items, with n ≤ m/2. Open addressing is used for collision resolution.
**a.**Assuming uniform hashing, show that for i=1,2,…,n, the probability is at most 2^−k that the ith insertion requires strictly more than k probes.
**b.**Show that for i=1,2,…,n, the probability is O(1/n^2) that the ith insertion requires more than 2lgn probes.
Let the random variable Xi denote the number of probes required by the ith insertion. You have shown in part (b) that  ) . Let the random variable  denote the maximum number of probes required by any of the n insertions.
**c.**Show that Pr{X > 2lgn}=O(1/n).
**d.**Show that the expected length E[X] of the longest probe sequence is O(lgn).
a.
P = (n/m)^k < (1/2)^k = 2^-k
b.
代入a中的结论即可
c.
 )
d.
该题可以参考5.4.2节的关于球与盒子的结论和5.4.3节的关于序列的结论.
我们把每次的概率放大为1/2(实际上是≤ 1/2的)
所以是O(lgn)
Suppose that we have a hash table with n slots, with collisions resolved by chaining, and suppose that n keys are inserted into the table. Each key is equally likely to be hashed to each slot. Let M be the maximum number of keys in any slot after all the keys have been inserted. Your mission is to prove an O(lg n/lg lg n) upper bound on E[M], the expected value of M.
a. Argue that the probability Qk that exactly k keys hash to a particular slot is given by
 (1-\frac{1}{n})^{n-k} C_k^n)
Follow @louis1992 on github to help finish this task.