We will devote one lecture to recursion and how a computer handles function calls using the call stack (which is hidden from us when we program).

Recursion is a beautiful problem-solving strategy and is used by data structures in the second half of the course. The "repetition" course book has a very nice introduction to recursion, with exercises that start easy and get harder until you master recursion. The starting guide asked you to do the recursion practice exercises as preparation for this course. But many of you registered late and thus unfortunately didn't have much time to prepare, so we will review recursion in this lecture.

Reading

From the "repetition" course book. You don't have to do all the exercises in each section (but do so if you don't feel confident).

Live practice problems: TBD