Hash Function Efficiency Comparison
This is a small C program written for CSI402 at Ualbany. It uses two hash functions provided and outputs information about the efficiency of them. The hash tables resolve collision by using chaining. The following information is examined:
- The size of the hash table
- The number of non empty buckets
- The maximum number of entries within the buckets
- The minumum number of entries within the non empty buckets
- The average number of entries within the buckets
An example input file and output file has been provided courtesy of Proffesor Ravi. Both hash functions are also provided courtesy of proffesor Ravi.