数据结构Hashing.pptVIP

* * * * * * * * * * * * * * * * * * * Positive constant正常数 * * * * * * * * * * * * a prime number 质数 * * * * * * * * * * * * Separate Chaining Fig. 19-10 Where new entry is inserted into linked bucket when integer search keys are (a) duplicate and unsorted; Separate Chaining Fig. 19-10 Where new entry is inserted into linked bucket when integer search keys are (b) distinct and unsorted; Separate Chaining Fig. 19-10 Where new entry is inserted into linked bucket when integer search keys are (c) distinct and sorted Hashing as a Dictionary Implementation Specifications for the ADT Dictionary Contains entries that each have two parts A key word or search key A value associated with the key Fig. 17-1 An English dictionary. Specifications for the ADT Dictionary Fig. 17-2 An instance of an ADT dictionary has pairs of search keys and corresponding values Specifications for the ADT Dictionary Data Pairs of objects (key, value) Number of pairs in the collection Operations add remove retreive contains traverse keys traverse values isFull get number of entries remove all entries Specifications for the ADT Dictionary Additional refinement possibilities Distinct search keys vs. Duplicate search keys Secondary search keys View Java source code for interface Load Factor Perfect hash function not always possible or practical Thus, collisions likely to occur As hash table fills Collisions occur more often Measure for table fullness, the load factor Cost of Open Addressing Fig. 20-1 The average number of comparisons required by a search of the hash table for given values of the load factor when using linear probing. Cost of Open Addressing Fig. 19-12 The average number of comparisons required by a search of the hash table for given values of the load factor when using either quadratic probing or double hashing. Note: for quadratic probing or double hashing, should have 0.5 Cost of Separate Chaining Fig. 20-3 Average number of comparisons required by search o