ConceptSystems & CS
Tree recursion time complexity
The time complexity of computing Fibonacci recursively grows exponentially, proportional to 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
4The lectures that define it or assume it, and the concepts next to it.