Pulsars
0 %
Log inSign up

The cost of naive recursion

MCQ

What is the cost (the complexity) of computing F(n) with the naive recursion fib(n) = fib(n-1) + fib(n-2)?

Possible answers