第九章散列表.pptVIP

长度为8的字符串，最大值为8×127=1016，第一种方法没有利用表长。 第二种方法仅取前三位进行计算，按等比数列求和方法可得到数据的组合大约为17576，实际组合为 * The birthday problem tells us that we‘re going to have collisions. You need a quadratic amount of memory to avoid collisions. In the lower balancing, a coupon collector analysis tell us that the collisions are going to be evenly distribute, distributed among the table, around the table. * this was studied in detail by Knauf, Don Knauf, in the 1960s and actually this problem, Knauf says, was the origin of the origin of analysis of algorithms. Mathematicians were trying hard to understand this problem and were ready to give up and he realized you could use classical balls and bins type probabilistic analysis. Not an easy analysis, but we actually could make precise accurate statements about the performance of this algorithm. And those statements can be borne out in practice, because the hash functions approximate random, the math assumes random and the formulas predict what actually happened in practice. No way can you formulate the problem as so called parking problem. So, what happens is that you are on a one way street and you are looking for a parking place and, its, the ideas you start looking for a parking place at particular times and say Okay, now I need a parking place, and what youre doing is linear probing hashing. If the current space is taken, you try the next space and the one after and so forth. And the question is. If every car. Starts looking for a place at a random time. That. Then that models the hash function, then how far do they have to go to look for a place? Thats canoots parking problem. And he was able to show, and well talk just a little bit about this, that if, theres, only half of the parking spaces are occupied, then, on average, half the people find, find it after one place and the other half have to look one extra. So thats the kind of performance that we want. But as it gets full. The displacement gets up to square root, of pi M over eight. Which is o