A

Admin • 831.35K Points
Coach

Q. What is the time complexity of the recursive implementation used to find the nth fibonacci term?

  • (A) o(1)
  • (B) o(n2)
  • (C) o(n!)
  • (D) exponential
Explanation by: Admin
the recurrence relation is given by fibo(n) = fibo(n – 1) + fibo(n – 2). so, the time complexity is given by:

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.