数据结构_查找2.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 45 bt 90 24 3 37 61 70 100 Delete 37 b e c d g h a After deleting 37 45 90 bt 100 3 24 61 70 c g h e HASHING All search algorithms so far Rely on comparison operations Performance O(n) or O( log n) Assume a function that maps a key to an integer f ( key ) ? integer The operations (insert ,search) : O(1). Hash Tables The most simplest implementation of a hash table is using an fixed size array. In a hash table, a hash function is used to map keys into the positions in the table. This action is called hashing The ideal hashing case: if a record p has a key k and f is the hash function, then p is stored in position f(k) of the table (index: 0..m-1) . Hash function - Address Calculator Hash Function Hash Table m-1 {Zhao, Qian, Sun, Li, Wu, Chen, Han, Ye, Dei} Example：there are 9 keys Hash function f(key) =?(Ord(first char) -Ord(A)+1)/2? Zhao Chen Qian Sun Li Wu Han Ye Dei Problem: insert key Zhou , what will happen? Hashing- General Idea When an record needs to be inserted into the Hash Table: The record is stored in the array at an index value got by a Hash function. If more than one key (items) are mapped into the same index value, then we say that we have a collision. key1? key2，but f(key1) = f(key2). It is hard to avoid collisions totally. Hash Functions It is impossible to find a hash function which can totally avoid collisions. So f needs to have the following properties. ? f ( x ) must be easy to compute and minimizes the number of collisions. ? f ( x ) should be unbiased. That is, for any x and any i, we have that Probability( f ( x ) = i ) = 1 / m. Such kind of a hash function is called a uniform hash function. Hash Functions – Modulo Modulo operator provides a simple and effective hash function. We will use modulo as our hash function in the rest of our discussions. h(x) = x mod m (m is the tableSize) The table size should be a prime: 7,11,