Example $3\mathrm{.}4$ Consider the sequential search algorithm for finding a specified value in an array of integers. If visiting and examining one value in the array requires $c_s$ steps where $c_s$ is a positive number, and if the value we search for has equal probability of appearing in any position in the array, then in the average case $T(n)=c_s\frac{n}{2}.$ For all values of $n$I, GII $24$ Therefore, by the definition, $T(n)$ is in $O(n)$ for $n0=1$ and c$=$cs