Fibonacci Sequence Visualization

Compare Dynamic Programming vs Memoization approaches

Number (n)

Range: 0-20

Algorithm

Result

Click start to compute

Fibonacci Algorithm Comparison

Bottom-up DP

Time: O(n)

Space: O(n)

Approach: Iterative, builds from F(0)

Memory: Array storage

Top-down Memoization

Time: O(n)

Space: O(n)

Approach: Recursive, caches results

Memory: HashMap storage