Track 5 · Lesson 11 of 12

Recursion: functions that call themselves

Solve a problem by reducing it to a smaller version of itself, with a base case that stops the recursion.

You will be able to

• Explain what a recursive function is and trace a recursive call step by step
• Identify the base case and the recursive case of a recursive function
• Write recursive functions such as factorial and digit sums
• Recognise a RecursionError and fix a missing or unreachable base case