- Define what recursion is
- Solve a recursive-iteration problem.
- Solve a recursive problem (bottom up).
Recursion is when a function call itself. It's common method of simplification that divides a problem into subproblems of the same type. As a computer programming technique, this is called divide and conquer and is key to the design of many important algorithms. Divide and conquer serves as a top-down approach to problem solving, where problems are solved by solving smaller and smaller instances.




