数据结构英文教学课件：chapter10 Hashing.pptVIP

Chapter 10Hashing Hash table Support the following operations Find Insert Delete. (deletions may be unnecessary in some applications) Unlike binary search tree, AVL tree and B+-tree, the following functions cannot be done: Minimum and maximum Successor and predecessor Report data within a given range List out the data in order Unrealistic solution Each position (slot) corresponds to a key in the universe of keys T[k] corresponds to an element with key k If the set contains no element with key k, then T[k]=NULL Unrealistic solution insert, delete and find all take O(1) (worst-case) time Problem: The scheme wastes too much space if the universe is too large compared with the actual number of elements to be stored. E.g. student IDs are 8-digit integers, so the universe size is 108, but we only have about 4000 students in Software College. Hashing Example applications Compilers use hash tables (symbol table) to keep track of declared variables. On-line spell checkers. After prehashing the entire dictionary, one can check each word in constant time and print out the misspelled word in order of their appearance in the document. Useful in applications when the input keys come in sorted order. This is a bad case for binary search tree. AVL tree and B+-tree are harder to implement and they are not necessarily more efficient. Hashing With hashing, an element of key k is stored in T[h(k)] Hashing h: hash function maps the universe U of keys into the slots of a hash table T[0,1,...,m-1] an element of key k hashes to slot h(k) h(k) is the hash value of key k Hashing Problem: collision two keys may hash to the same slot can we ensure that any two distinct keys get different cells? No, if |U|m, where m is the size of the hash table Design a good hash function that is fast to compute and can minimize the number of collisions Design a method to resolve the collisions when they occur Hash Function The division method h(k) = k mod m e.g. m=12, k=100, h(k)=4 Req