Recursion

Recursion is a method of solving problems where the solution depends on solutions to smaller instances of the same problem. A recursive algorithm must have a base case. A recursive algorithm calls itself, recursively.

Visit the following resources to learn more:

• Recursion in 100 Seconds
• Lecture 8 | Programming Abstractions (Stanford)
• Lecture 9 | Programming Abstractions (Stanford)
• Lecture 10 | Programming Abstractions (Stanford)
• Lecture 11 | Programming Abstractions (Stanford)
• 5 Simple Steps for Solving Any Recursive Problem