Week 11 (62)

Three approaches to dealing with hash collisions:

allow multiple Items in a single array location
- e.g. array of linked lists (mix of O(1) and O(N))
systematically compute new indexes until find a free slot
- need strategies for computing new indexes (aka probing)
increase the size of the array
- needs a method to "adjust" hash() (e.g. linear hashing)