Chapter 17, Problem 3PC

Program Plan Intro

Searching for Objects with the Binary search Algorithm

Program plan:

• Create the class “ObjectBinarySearcher”,
  • Define the “search()” method,
  • Declare the required variables.
  • Use the while loop to check whether the searching value is found in the array or searching reaches end of the 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.
    • Call the “quicksort()” method to sort the values.
    • Execute the do…while loop to search the value in the array until it iterates all the elements in the 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 “element not found in the array”.
    • If the user needs to continue the choice to search the element. Press yes or “y” to continue otherwise exit the program.