Hash table design [description of the problem] really right in your collective (such as in your class) in the design of a hash table of names, bringing the average search length of less than R, the completion of construction of the corresponding tables and look-up table procedures. [Basic requirements] assumed the names of people known as the Chinese pinyin form, fill in the hash table to be a total of 30 names, taking the average search length of the upper limit of 2. Hash function with the addition of more than a few ways to stay construction, using pseudo-random probing re-hashing to resolve disputes.

find
....\debug
....\.....\find.exe
....\.....\find.obj
....\.....\find.pdb
....\.....\vc60.pdb
....\find.c
....\find.dsp
....\find.dsw
....\find.ncb
....\find.opt
....\find.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．