What is the time complexity of a naive recursive Fibonacci function?
The time complexity is O(n) because the function only calls itself once for each value.
Iâ€™m disappointed with this answer. The time complexity of the naive approach is actually exponential (O(2^n)).
Can you explain why the recursive solution has such high time complexity?