Description: //Use the hash function: H (k) = 3* k MOD length, and open addressing treatment conflicts. The test input keyword sequence constructed hash table, the length of the hash table length,// ask the average search length for the case of probability to find success and complete algorithm to design construct a hash table.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 哈希查找 | 哈希表.doc |
Download