Description: For a group of names to design a hash table, making the average length of no more than R to find the assumption that hash table to be populated with the names of 30, the average search length is 2. Hash table with the exception of law to stay more than a few structures, pseudo-random detection by law to deal with conflict in the hash.
To Search:
- [find] - Hash table design [description of the pr
File list (Check if you may need any files):
数据结构课设
............\bianma.txt
............\Huffman.txt
............\jiema.txt
............\成功1.cpp
............\成功2.cpp
............\成功3.cpp
............\课程设计报告.doc
Download