Chapter 16, Problem 3SA

Explanation of Solution

Binary search algorithm:

The binary search algorithm is used to find an item in an array and the search array should be in the sorted order.

• The searching is started in the middle of the array.
• In the searching process, the algorithm finds an item or eliminates half of the array in each comparison.
• If the search item is less than the middle item, then it eliminates the second half of the array, and it continues to search in the first half of the array.
• If the search item is greater than the middle item, then it eliminates the first half of the array, and it continues to search in the second half of the array.
• Once again, it examines the middle and repeats the above steps to find an item.
• If the middle item is equal to search item, then the searching is stopped...