For hash table lookup failure when the average search length of hash function in how to calculate the amount of the value, in accordance with the problem of linear detection method, for example, thank everybody shows

CodePudding user response:

Fail to see the hash address corresponding to the presence of the keyword, if not, the number 1, and if so, the number of matches to the next without the number of keyword address (match), such as address 3 with 12, 10 keywords without key 3 - & gt; Ten eight times.

CodePudding user response:

Hash function mod 11, 3 k is the number of hash function values, hash function value is 0 to 10, in turn

CodePudding user response:

Hash function mod 11, 3 k is the number of hash function values, hash function value is 0 to 10, in turn