โณ Recursive Recursion Emulator
Visualize โข Animate โข Compute โข Memoize
Recursive Function
๐ Fibonacci(n)
๐ข Factorial(n)
๐ผ Towers of Hanoi(n)
โ๏ธ GCD(a, b)
โก Power(x, n)
๐ฅ Ackermann(m, n)
๐ฟ Tribonacci(n)
๐ฃ Sum of Digits(n)
๐ฆ Count Nested(depth)
๐ง Memo OFF
โถ Run
Presets:
Fib(8)
Fib(10)
Fact(7)
Hanoi(4)
GCD(48,18)
Ackermann(3,4)
Trib(9)
โฎ
โธ Pause
โญ
Step 0/0
Speed
Total Calls
โ
Unique Calls
โ
Max Depth
โ
Result
โ
Recursion Tree
๐ง Memoized nodes in pink
Hover nodes for details
Call Stack
Memo Cache
No cache yet
Formula / Recurrence
Time Complexity Without vs. With Memoization
๐ง How does memoization work here?
โ Add Merge Sort
๐ Compare with/without memo
๐ฅ Deep dive: Ackermann