Naive recursive Fibonacci <code>fib(n) = fib(n-1) + fib(n-2)</code> has time complexity
- Acheck_circle
O(2ⁿ)
- B
O(n²)
- C
O(log n)
- D
O(n)
Explanation
Branching tree; exponential without memoization.
Recursion
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?