Collision Resolution

Open Addressing

Linear Probing

Increment by one until you have an open location. This is usually the simples collision resolution algorithm and tends not to be terribly efficient especially when you have multiple collisions at the same location.

Double Hashing

Hash again if you have a collision.

Quadratic Probing

Use an arbitrary polynomial algorithm at every increment.

H + i^2
H + 1^2, H + 2^2, H + 3^2 ... H + k^2

Separate Chaining

Separate chaining uses a linked list to resolve collisions.