Recursion Recap
| Lesson overview |
Lesson overview
Topics covered: factorial, Fibonacci, call stack visualization.
Recursion
Function calling itself with base case to stop
Example: factorial(n) = n * factorial(n-1)
Fibonacci: fib(n) = fib(n-1) + fib(n-2)
Call stack: each call adds a frame, returns when base case reached
Article author: Arthur Isaev