Computer Science - Algorithms - Recursion - Recursion Fundamentals

5 steps. Step 1 'What is Recursion?': A function that calls ITSELF. Must have: 1) Base case (when to stop), 2) Recursive case (call self with smaller input). Without base case → infinite loop → stack overflow! Step 2 'Factorial Example': def factorial(n): if n <= 1: return 1 (base case); return n *