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
There are no human answers yet.
Answered by
GPT 3.5
O(logn)
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.