ConceptSystems & CS
Recursive Fibonacci complexity
The worst-case time complexity of the recursive Fibonacci implementation is exponential, specifically , because each recursive call branches into two separate recursive calls at each level of the call tree.
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.