Chapter 9.2, Problem 9.3CP

The average number of comparison in binary search for the array with 20,000 elements is “15”.

Program Plan Intro

Binary search:

• Binary search is a smart search process that searches for the particular element that is present in the array from the middle towards the left or right until the search element is found.
• The search element is searched from the middle as the elements present in the array needs to present in the sorted order.
  • If the search element is larger it will search towards the right of the array.
  • If the search element is smaller it will search towards the left of the array.
• The search continues in a narrow way that it searches for the quarter of the array until there are no values left in the array to search or compare.
• The search of the target element is made in the smart way it eliminates a portion of array based on the given element as the array is sorted.