Skip to main content

Recursion Vis

Temporal Flow & Call Stacks

Initializing Recursion Canvas...

Playback Speed1x
Recursion Internals
Best Time
Ω(2^n)
Worst Time
O(2^n)
Aux Space
Θ(2^n)
Recursive Logic
1Algorithm Fibonacci(n):
2 If n <= 1: Return n
3 Return Fibonacci(n-1) + Fibonacci(n-2)