Question $1$

$2$ pts

What is the time complexity of a linear search algorithm in the worst case?

$O(n^2)$

$O(n)$

$O(1)$

$O(nlogn)$