What is the time complexity of the recursive implementation used to find the nth fibonacci term?
Posted: Wed Jul 13, 2022 7:40 pm
a) O(1)
b) O(n2)
c) O(n!)
d) Exponential
b) O(n2)
c) O(n!)
d) Exponential
Accurate answers. Every time.
https://answerhappy.com/