Description: The use of hash function the key value calculated, the first test table in hash key position if there is a keyword. If not, then the key is assigned to the keyword domain. If there is, then examine its keyword domain keywords and capture the keywords in the same. If the same, only the keyword occurrences plus 1 on the line. If not the same, in turn towards the back of inspection, until the emergence of the same keyword, only the hash table in a collision domain plus the number of cycles, add 1 to appear domain. If the searched hash form did not find the same, to insert a new node
To Search:
File list (Check if you may need any files):
hash.c
Download