Chapter 9 Tables And Information Retrieval（统计表和检索系统）49P.ppt

while( table[probe]!=null table[probe]!=new_entry probe_count(hash_size+1)/2) { probe_count++; probe=(probe+increment)%hash_size; increment += 2; } if(table[probe]==null) table[probe]=new_entry; else if(table[probe]==new_entry) result=duplicate_error; else result=overflow; return result; } Is the location empty? Duplicate key? Has overflow occurred? Prepare increment for next iteration Insert new_entry he table is full 4. Collision Resolution by chaining ◆ The linked lists from the hash table are called chains. ◆ If the records are large, a chained hash table can save space. ◆Collision resolution with chaining is simple; clustering is no problem. ◆ The hash table itself can be smaller than the number of records; overflow is no problem. ◆ Deletion is quick and easy in a chained hash table. ◆If the records are very small and the table nearly full, chaining may take more space. Code for Chained Hash Tables class Hash_table { public: // Specify methods here. private: ListRecord table[hash_size]; }; Constructor: The implementation of the constructor simply calls the constructor for each list in the array. Clear: To clear the table, we must clear the linked list in each of the table positions, using the List method clear( ). Retrieval: Sequential_search(table[hash(target)], target, position); Insertion: table[hash(new entry)].insert(0, new entry); Deletion: Error_code Hash table :: remove(const Key type target, Record x); Example: 设一个散列表包含hash_Size = 13个表项，其下标从0到12，散列函数采用除留余数法，用%hash_Size将各关键码映像到表中，采用线性探查法解决冲突。给定的关键码集合是： {400,126,45,32,58, 100,3,29,200,10,36 }。 假设每一个关键码被查找的概率相同，请计算出ASL=？ 9.7 Analysis of Hashing 1. The Birthday Surprise How many randomly chosen people need to be in a room before it becomes likely that two people will have the same birthday