Recursion and Memoization

Explain the concept of recursion, identifying base cases and recursive steps

Design recursive solutions for problems that can be broken into smaller, self-similar subproblems

Trace the call stack for a simple recursive function

Explain the concept of memoization to optimize overlapping subproblems in recursion

Apply memoization to a recursive solution, such as calculating Fibonacci numbers