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.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.