Track 16 · Lesson 5 of 12

Recursion in depth

Solve problems by reducing them to smaller copies of themselves, split work with divide and conquer, and remove repeated work with memoisation.

You will be able to

• Write recursive functions with a correct base case and a recursive case that makes progress
• Process nested data such as folders and category trees recursively
• Use divide and conquer to split a problem into halves
• Recognise repeated subproblems and fix exponential recursion with memoisation
• Decide when a loop is a better choice than recursion