(in brackets, the last time each file was modified)

Theory slides:

- 0. Presentation (Sept 26th. updated info about exams, in red)
- 1. Analysis of algorithms (Sept 14th)
- 2. Dictionaries and sets (Sept 19th; update note: just added a clarification about using list(...) in slide 20)
- 3. Recursion, part 1 (Sept 25th; minor update: added "return c(x)" in 26, removed duplicate slide 28)
- 4. Recursion, part 2 (Oct 1st)
- 5. Recursion, part 3 (Oct 19th - fixed mistake in mergesort)
- ... more soon

Labs:

- Lab 1. Efficiency, sorting, dictionaries (Sept 19th)
- Lab 2. Simple recursion: combinatorial numbers and palindromes (Sept 27th)
- Lab 3. More recursion: ints are digits and strings are characters (Oct 2nd)
- Lab 4. More recursion: Fibonacci numbers and flattening lists (Oct 1st)
- Lab 5. More recursion: Mergesort and finding a maximum; see useful picture (Oct 17th)