Chapter 19, Problem 19.7PE

Program Plan Intro

Generic binary search

Program Plan:

• Define the class named “Exercise19_07”.
  • Define the main method.
    • Declare and initialize an array “arr[]” in type of integer.
    • Call the generic method “binarySearch()” with array and key elements. Print the resultant positions on screen.
  • Define the generic method named “binarySearch()” which passes array list and key as arguments.
    • Declare and initialize the variables “low” and “high” in type of integer.
    • Using “while” loop, check the value of “high” greater than value of “low”.
      • Calculate the middle value using “low” and “high” value.
      • Using “if” condition, compare the key value with list values.
        • If the condition is true, calculate value of “high” using formula “mid-1”.
        • Otherwise, check the condition of to calculate the “key” value with list values.
          • Return value of “mid”.
    • Return appropriate position to calling function.