ConceptSystems & CS
Space complexity of recursive Fibonacci
The space required by the recursive Fibonacci process is proportional to the maximum depth of the recursion tree, which grows linearly with n.
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.