🔁
Recursion
Functions that call themselves to solve problems by breaking them into smaller subproblems
Visualization
Call Stack
Depth: 0
📭
Call stack is empty
Recommended: Keep n ≤ 8 for better visualization
Functions that call themselves to solve problems by breaking them into smaller subproblems