Description: Suppose the hash function is perfect, that is, input data can be uniformly dispersed in the hash table. Hash table size H, insert the data quantity K, the rate of conflict in order to hash table should be derivation. Specifically this: assuming that there is 20W data to be inserted, Hash table size is 60W, the conflict in order to hash table rates.
To Search:
File list (Check if you may need any files):
Hush.exe
实验报告.doc
源程序\AverLength.cpp
......\AverLength.h
......\Hush.cpp
......\Hush.h
......\main.cpp
源程序
Download