Two general categories of recursion functions:

  1. repeatedly execute a task

  2. perform a calculation based on a subproblem


Approach recursion with a top-down approach. Strategy (from A Common-Sense Guide to Data Structures and Algorithms, Second Edition )

  1. Imagine the function you're writing has already been implemented

  2. Identify the subproblem of the problem

  3. See what happens when you call the function on the subproblem and go from there

Last updated