Recursion

Fibonacci

Each term is the sum of the two previous terms.

Learn with an interactive visualization

Category: Recursion. Complexity: O(2ⁿ) recursive · O(n) memoized.

Each term is the sum of the two previous terms. Interactive visualization, Java code, operations, complexity, and a complete beginner-friendly explanation.