Description: 1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table build process, and output the hash table. 3. Write function, seeking to find the average successful search length (ASL).
To Search:
File list (Check if you may need any files):
yy6
...\Debug
...\.....\vc60.idb
...\.....\vc60.pdb
...\.....\yy6.exe
...\.....\yy6.ilk
...\.....\yy6.obj
...\.....\yy6.pch
...\.....\yy6.pdb
...\yy6.cpp
...\yy6.dsp
...\yy6.dsw
...\yy6.ncb
...\yy6.opt
...\yy6.plg
Download