Exact amount of loop iterations here?
It will iterate $n-4$ steps if $n&gt;4$ . If  $n\leq4$  there will be no iteration since the condition is not satisfied. The important thing is that the linear search runtime grows like the sequence size in the worst case. The notation we use for works like $c_1.n+c_2$ is Θ (n).