Chapter 17, Problem 5PC

Program Plan Intro

ObjectBinarySearcher class

Program plan:

• Create the class “ObjectBinarySearcher”,
  • Define the generic method “search()” that implement “Comparable” interface.
  • Declare the required variables.
  • Use the while loop to check whether the searching value is found in the array or searching reaches the end of an array.
    • Calculate the “middle” value.
  • Check whether the “middle” value is at index “0”. If yes, then set the boolean value for “found” to be “true”.
    • Assign the “middle” value index to “position” variable.
  • Check whether the searching value when compared to “middle” is greater than 0.
    • If yes, search the left half of the array otherwise search the right half of the array.
  • Return the position of the element.
• Create the class “ObjectBinarySearchTest”,
  • Define the “main()” function,
    • Assign the string values.
    • Read the input from the user through “Scanner” to search the value in the array.
    • Execute “do…while” loop to search the value in an array until it iterates all the elements in an array.
    • Call the “search()” method to find the searching element in the array.
    • If the searching value is found, then print the corresponding message otherwise print the message as “element is not found in the array”.
    • If the user needs to continue search some other element then press “Y”, or “y” to continue and “N”, or “n” to exit the program.