Description: 1 basic training
(1) to establish orderly table, using a binary search to achieve a known keyword search.
(2) enter a set of keywords, binary sort tree insertion algorithm to establish a binary sort tree, then remove a specified keyword elements.
2. Comprehensive training
Hash table design:
Description
Design a hash table for the "names" in a collective (such as your classes), so that the average length of no more than R, the completion of the construction table and table look-up procedure.
Basic requirements
Assuming that people called the pinyin form of the name of the Chinese people. A total of 30 names to be filled into the hash table, take the upper limit of the average search length. The hash function is used in addition to stay the remainder method (H (key) = key
To Search:
File list (Check if you may need any files):
Harsh.c
二叉排序树.c
折半查找.c
Download