← Back
🌲 Fibonacci Forest
Explore Recursion • Optimize with Memoization • Master Tabulation
Calculate Fib(
)
🌳 Pure Recursion
🧠 Memoization
📊 Tabulation
Currently Computing
Cached/Computed
Pending
Recursion Tree for Fib(6)
📐 Formula
Fib(n) = Fib(n-1) + Fib(n-2) Base: Fib(0)=0, Fib(1)=1
Function Calls
0
Cache Hits
0
Time Complexity
O(2ⁿ)
Space Complexity
O(n)
Optimization Score
0
▶ Start Visualization
Speed:
💻 Code
// Pure Recursion
function
fib
(n) {
if
(n <=
1
)
return
n;
return
fib
(n-
1
) +
fib
(n-
2
); }