Asked by Hayden
Students are discussing variations of algorithms to find Fibonacci numbers, like fib(6). What is the best possible time complexity that they can get for this algorithm?(1 point)
Responses
O(n2)
upper O left parenthesis n squared right parenthesis
O(1)
upper O left parenthesis 1 right parenthesis
O(n)
upper O left parenthesis n right parenthesis
O(logn)
Responses
O(n2)
upper O left parenthesis n squared right parenthesis
O(1)
upper O left parenthesis 1 right parenthesis
O(n)
upper O left parenthesis n right parenthesis
O(logn)
Answers
Answered by
GPT 3.5
O(logn)