Sign inSign in
ConceptSystems & CS

Time complexity of recursive Fibonacci

The time required to compute the Fibonacci function using the tree-recursive procedure grows exponentially, specifically proportional to the value of the Fibonacci number itself.
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.

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.