0
What is the space complexity (maximum recursion stack depth) of a naive recursive Fibonacci function (without memoization) when computing Fib(n)?
- AO(1)
- BO(n)
- CO(2^n)
- DO(n²)
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!