Quote:
Linear Probing - collisions are resolved by sequenaially scanning an array(with wrap-around) until an empty cell is found.
Quadratic Probing - examines cells 1, 4, 9 and so on, away from the original probe point. If the table size is prime and the load factor is no larger than 0.5(half full), then all probes will be to different locations and an item can always be inserted.
Separate Chaining Hashing - Separate chaining hashing is a space-efficient alternative to quadratic probing in which we maintain an array of linked lists. It is less sensitive to high load factors.