I Computer Science A

UNIT $3$

LESSON $15$

Data Structures and Algorithms

Data Structures and Algorithms Unit Test

Determine the time and space complexities of a linear search. $(1$ point$)$

time complexity: $O(n)$

space complexity: $O(log(n))$

time complexity: $O(log(n))$

space complexity: $(n)$

time complexity: $O(n)$

space complexity: $O(n)$

time complexity: $O(log(n))$

space complexity. $O(log(n))$