Consider linear search again (see Exercise 2.1-3). How many elements of the input sequence need to be checked on the average, assuming that the element being searched for is equally likely to be any element in the array? How about in the worst case? What are the average-case and worst-case running times of linear search in -notation? Justify your answers.

On average, half the the elements in array will be checked before is found in it. And in the worst case ( is not present in ), all the elements needs to be checked.

So, both running time are of the form , i.e. .

If you have any question or suggestion or you have found any error in this solution, please leave a comment below.