Collision Resolution Methods
Linear Probing: (h(key) + c?k) mod n
Quadratic Probing: (h(key) + c?k2) mod n
Double hashing: (i ? h2(key)) mod n
Rehashing: Create a larger hash table and try again. (Only perform when the load factor is at least 0.5).
Note: n should normally be a prime number to help avoid collisions. The constant c is normally small, and typically is 1.