Held: Monday, 17 November 2014
We consider a simple implementation of dictionaries through linked lists of key/value pairs. These are often called "association lists".
getinvolves searching until you find a key or run out of elements
putinvolves adding it at an available spot
get? (Or, alternately, O(n) for for
put, which still requires O(logn) for