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?

Question

O(n)
O(log n)
O(n^2)
O(1)

Answer 1

The best possible time complexity for finding Fibonacci numbers is O(1).