Recursion

Visualize recursive algorithms with call stack tracking

Speed:

🔄

Select a recursive algorithm to begin

N (1-10)

Base (for Power)

Exponent (for Power)

Factorial: O(n)

Fibonacci: O(2^n) naive, O(n) optimized

Tower of Hanoi: O(2^n)

Power: O(log n) optimized