Chapter 7.10, Problem 7.10.3CP

Program Plan Intro

Array:

An array is defined as a group that consists of similar data types.

• The array size must be specified by an “int” value and not long or short.
• In Java, all arrays are allocated dynamically.
• An array is always indexed, starting from 0.

Binary Search:

Binary search algorithm’s strategy:

• The binary search algorithm is used to find an item in an array.
• The algorithm assumes that the item search array is sorted.
• The searching process starts at 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 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 the search item, then the searching process is stopped.
• The search is stopped when an item is found or the search reaches the empty portion of the array.