What is the time complexity of the naive recursive Fibonacci, fib(n) = fib(n-1...

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

What is the time complexity of the naive recursive Fibonacci, fib(n) = fib(n-1) + fib(n-2) (no memoisation)?

O(2^n) (exponential)

✅

O(n^2)

❌

O(n)

❌

O(\log n)

❌

Want instant access to all verified answers on learning.monash.edu?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome