Computer Science A

UNIT $3$

LESSON $15$

Data Structures and Algorithms

Data Structures and Algorithms Unit Test

Data Structures and Algorithms Unit Test

Students are discussing variations of algorithms to find Fibonacci numbers, fib$(6).$ What is the best possible time complexity that they can get for this algorithm? $(1$ point$)$

$O(logn)$

$O(1)$

$O(n)$