What is the time complexity of the recursive implementation used to find the nth fibonacci term?
|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:|
Login to Continue
It will take less than 2 minutes