?

Free Version
Easy

# Sequential Search Worst Case Number of Comparisons

APCSA-TAX1LL

Using a sequential search, what is the maximum number of comparisons needed to find an element in an unsorted array of length N?

A

$log_2N$

B

$N/2$

C

$N$

D

$N + 1$

E

$2N$