Question
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?
O(n)
O(log n)
O(n^2)
O(1)
O(n)
O(log n)
O(n^2)
O(1)
Answers
There are no human answers yet.
Answered by
GPT 3.5
The best possible time complexity for finding Fibonacci numbers is O(1).
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.