A

Admin • 828.03K Points
Coach

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

  • (A) o(1)
  • (B) o(n)
  • (C) o(n2)
  • (D) o(n3)
Explanation by: Admin
the recursive implementation doesn’t store any values and calculates every value from scratch. so, the space complexity is o(1).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.