| Value | |
|---|---|
| Enter | Clear |
This demonstrates linear probing open hashing. The primary hash function is to take the key mod the table size. If the primary hash function yields a collision, the next cell will be tried. If there is another collision, the cell following, and so on, until an empty cell is found. The collided cells will have the resident value shown in red. The newly inserted element is shown in green.