patterns

Recursion

Recursion solves problems by having a function call itself with a smaller input until it reaches a base case. Every recursive solution needs a base case to stop and a recursive case that breaks the problem down. Understanding the call stack and how each frame stores its own variables is key to mastering recursive thinking.