Big O Notation

Question 1

O(1)

Answer 1

Constant time, independent of the input size, the algorithm doesn’t vary in efficiency as input size (n) grows

Question 2

O(n)

Answer 2

Linear time, dependent on the input size, the algorithm become less efficient as its input size (n) grows.

Question 3

O(log n)

Answer 3

• Logarithmic time, depended on the input size, the algorithm complexity minimizes as its input size (n) grows.