Notes and links will appear here as they become available.

Course Outline
Text for the course by Clifford Shaffer.
Open Data Structures (in C++) by Pat Morin
Asymptotics: Big Oh, Big Omega, Theta, and Little oh.
Gara Pruesse's notes

Dave Wessels' notes

MIT course notes on Big O (see page 275) and the Master Theorem (see page 307).
Elementary Data Structures
Check out Chapter 2 of Algorithm Design by Goodrich and Tamassia. The book has a nice treatment of many of the topics in this course, and we refer to them occasionally on this page.

Do you want to implment slothful algorithms?

Notes from Class

2007
2006 and prior

Older links from previous offerings of the course are available here, including 2005 notes by Dave Wessels:: Proof techniques
Lists: (review of basic linked lists from CSCI 161); Skip lists; Self-organizing lists; Sparse tables (using lists)
Trees: (review of basic binary search trees from CSCI 161); Balancing trees: avl trees; Heaps
Choosing ADTs: Deciding what kind of data structure(s) you need
Graphs: Graphs and implementations; Graph searches (depth-first, breadth-first); Spanning trees; Adjacency list implementation; Single-source and All-pairs shortest path algorithms
Hash tables: Hash tables, function, and collisions