Sign inSign in
ConceptSystems & CS

Recursive Fibonacci complexity

The worst-case time complexity of the recursive Fibonacci implementation is exponential, specifically Θ(2n)\Theta(2^n), because each recursive call branches into two separate recursive calls at each level of the call tree.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Asymptotic complexity notation1Recursion1Tree structure1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.