The best possible time complexity for finding Fibonacci numbers, particularly if you're using an efficient algorithm like matrix exponentiation or the fast doubling method, is:
O(log n)
So the correct response here is:
O(log n)
Responses
O(1)
upper O left parenthesis 1 right parenthesis
O(n)
upper O left parenthesis n right parenthesis
O(n2)
upper O left parenthesis n squared right parenthesis
O(logn)
1 answer
The best possible time complexity for finding Fibonacci numbers, particularly if you're using an efficient algorithm like matrix exponentiation or the fast doubling method, is:
O(log n)
So the correct response here is:
O(log n)