Algorithms and OOD (CSC 207 2014S) : Outlines
Held: Wednesday, 9 April 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
Copyright (c) 2013-14 Samuel A. Rebelsky.
This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit
or send a letter to Creative Commons, 543 Howard Street, 5th Floor,
San Francisco, California, 94105, USA.