Recursion

• When a function calls itself, it is termed recursion

• Often, there are very elegant solutions to problems that can be written recursively.

• The programming equivalent of “inductive proof”

• The first thing to do in a recursion is to stop it.

• Then re-write the problem in an incremental simpler form.