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

💬 Discuss

✅ Correct Answer: (D) exponential

Explanation: the recurrence relation is given by fibo(n) = fibo(n – 1) + fibo(n – 2). so, the time complexity is given by:

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the recurrence relation is given by fibo(n) = fibo(n – 1) + fibo(n – 2). so, the time complexity is given by:

💬 Discussion

📊 Question Analytics

👁️

768

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate