In one dictionary collision strategy, a linear search finds the next free slot when storing a colliding key. Lookup scans from the key’s hashed location until it finds a match. section 10.1
This approach uses linear search in two ways:
- On insertion, scan for an empty slot after a hash collision. section 10.1
- On lookup, scan from the hashed location to find the key; repeated collisions can leave data misplaced and force repeated scans. section 10.1
Figure 10.3 To find the value for a specific key, we need to linearly search the dictionary starting at the hashed location.

Shows lookup scanning from a key’s hashed location. section 10.1






