The first lecture introduces recursion, a technique in which a function calls itself. Recursing is an alternative way to develop iterative programs. It demonstrates recurin using the factorial funtion.

The second lecture continues our exploration of recursing by studying the Greatest Common Divisor (GCD) program.

The third lecture completes our exploration of recuring by studying a program to print a number in binary.

This tutorial covers the material in the lectures. (i.e. recursion)

This will be the first lab from the Calc Backlog. We will be working with this backlog for the rest of this unit, giving you the opportunity to work on a relatively large program. Some of the program is already implemented giving you the opportunity to read C code that someone else has written.

We will continue with the calc backlog.