ol Computer Science A

UNIT $3$

LESSON $12$

Data Structures and Algorithms

Selecting Simple Data Structure

Selecting Simple Data Structure Quick Check

Which of the following Big O notations is appropriate for the complexity of a search algorithm? $(1$ point$)$

$O(n^2)$

$O(n)$

$O(1)$

$(logn)$