Chapter 14, Problem 14RE

Explanation of Solution

a)

Linear Search:

When all the values present in the array or list are examined until the search element is found or until it reaches its end is called as linear search.

Given list:

The search list is “–7 1 3 3 4 7 11 13”.

The search element is “7”.The search is made from the start of the list till its end until the search element is found.

Iteration 1:

Check element at index 0.

The value -7 is not 7.

Iteration 2:

Check element at index 1...

Explanation of Solution

b)

Binary search:

The values that are searched are located in a sorted array by determining whether the search value is present in the first half or in the second half and once found then the search is repeated to find the value is one of the either halves is called as binary search.

Given list:

The search list is “–7 2 2 3 4 7 8 11 13”.

The search element is “8”, since the list is sorted, the location of search value can be guessed, that is in which half the value is present can be determined...

Explanation of Solution

c)

Binary search:

The values that are searched are located in a sorted array by determining whether the search value is present in the first half or in the second half and once found then the search is repeated to find the value is one of the either halves is called as binary search.

Given list:

The search list is “–7 1 2 3 5 7 10 13”.

The search element is “8”, since the list is sorted, the location of search value can be guessed, that is in which half the value is present can be determined...