Chapter 8.3, Problem 44E

a.

To determine

Number of steps required to find an item with sequential search.

Answer to Problem 44E

The number of steps required are $n$ .

Explanation of Solution

Given information : The algorithm of search is sequential search.

The sequential search, searches for an item in the list in order from first item to the last item. So, the number of steps to find an item can be $n$ .

b.

To determine

Number of steps required to find an item with binary search.

Answer to Problem 44E

The number of steps required are ${\log }_{2}n$ .

Explanation of Solution

Given information : The algorithm of search is sequential search.

The binary search, divides the list into two halves and checks that which half can have the desired item. This half list is again split into half and this is repeated until the item is fond. So, the number of steps to find an item is ${\log }_{2}n$ .