Lecture 19 (29 March)
We did exercises on
- Writing and solving recursive definitions for the
running times of simple algorithms.
- Recursive proof of algorithm correctness for quicksort.
Towers of Hanoi demo
Announcements
- Reminder: second midterm is in a week. Covers material
through lecture 17, i.e. through trees but not big-O.
- If you need a DRES room for the midterm,
sort that out NOW
- See the Exams web page for
skills list, previous midterm, review problems.
- Discussions this week are exam review: come prepared with questions.
- See Piazza for Sunday review session and revised office hours
next week.