Recursive Ladders

💡 How it Works

Recursive Case: sum(n) = n + sum(n-1)

Base Case: sum(1) = 1

Example: sum(5) = 5 + sum(4) = 5 + 4 + sum(3) = ... = 5 + 4 + 3 + 2 + 1 = 15

Time Complexity: O(n) - n recursive calls

Space Complexity: O(n) - n stack frames