### Problem Overview
Two collision resolution strategies for closed (i.e. open addressing) hash tables are linear probing and quadratic probing. We discussed the impact that the load factor has on performance of both techniques, and the side effect of primary and secondary clustering. It has been shown that secondary clustering (when using quadratic probing)"causes less than an extra half probe per search." (Weiss,p.199(3ed) or p.196(2ed)) These conclusions were based on a hash table with bucket size of 1. We would like to know the optimal bucket size for a given data set such that the number of probes is minimal. It might be 1, but it could be larger.
In this project, you will do a performance study of a closed hash table using both linear probing and quadratic probing for collision resolution. You will test each strategy using multiple [bucket][1] sizes. You will decide which bucket sizes to test and how many you need to test to draw some conclusions. You will need to run the program using several bucket sizes to determine the optimal bucket size.
The table size must be a [prime number][2]. Use 503 to begin.
For each resolution policy, you will test two strategies for load factor: first restrict the load factor to 0.5. If the load factor exceeds 0.5, resize the table to the next prime that is closest to double the previous table size. Next, allow the load factor to reach 1.0. The load factor, in this project, will include the deleted elements.
## Deliverables
This C++ program is to be run on Visual Studio. I want the work to look like a college project.