Using Brent's Method to solve collisions
The main file includes an example
Includes three functions:
insert: The parameter passed is the value to be inserted into the hashtable
find_num_probes: Finds out how many ‘hops’ are required to find a certain key inside the hash table. Assume that the searched key always exists in the table.
find_average_num_probes: Computes average number of probes required to find a key in this table.