Collision Resolution by Progressive Overflow
How do we deal with records that cannot fit into their home address? A simple approach: Progressive Overflow or Linear Probing.
If a key, k1, hashes into the same address, a1, as another key, k2, then look for the first available address, a2, following a1 and place k1 in a2. If the end of the address space is reached, then wrap around it.
When searching for a key that is not in, if the address space is not full, then an empty address will be reached or the search will come back to where it began.