Search Algorithms

As seen in Section $3\mathrm{.}2,$ when we want to search for a given value within a sorted array we can use linear search or binary search.

Consider an array of $5000$ positions, which of the following values is the closer to the number of iterations needed to search for the last element of the array when using linear search?

$12$

$24$

$5000$

$1000$