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.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, 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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(1 point) By dragging statements from the left column to the right column below, give a proof by induction of the following statement: an = = 9" - 1 is a solution to the recurrence relation an = 9an-18 with ao = : 0. The correct proof will use 8 of the statements below. Statements to choose from: Note that a₁ = 9a0 + 8. Now assume that P(n) is true for all n ≥ 0. Your Proof: Put chosen statements in order in this column and press the Submit Answers button. Let P(n) be the predicate, "a = 9″ – 1". απ = 90 − 1 = Note that Let P(n) be the predicate, "an 9" - 1 is a solution to the recurrence relation an = 9an-1 +8 with ao = 0." - Now assume that P(k + 1) is true. Thus P(k) is true for all k. Thus P(k+1) is true. Then ak+1 = 9ak +8, so P(k + 1) is true. = 1 − 1 = 0, as required. Then = 9k — 1. ak Now assume that P(k) is true for an arbitrary integer k ≥ 1. By the recurrence relation, we have ak+1 = ak+1 = = 9ak + 8 = 9(9k − 1) + 8 This simplifies to 9k+19+8 = 9k+1 − 1 Then 9k+1 − 1 = 9(9*…

Given the following request to an AI chatbot, which response is more accurate? (You should use Google to verify that the factual claims in each response are accurate.) Prompt Is this true? The first recorded use of the phrase "when pigs fly" in print is in a 1616 play by Ben Jonson called "The Devil is an Ass," in which a character says, "When pigs fly, good-night!!" Response Response A Response B Yes, that's true! The phrase "when pigs fly" indeed appears in Ben Jonson's 1616 play The Devil is an Ass and was said during the second act in a conversation between Fitzdottrel and Pug. The phrase was first used to express skepticism or disbelief, suggesting that something is as unlikely to happen as the fanciful idea of pigs flying. This usage is often cited as one of the earliest instances of the phrase in print. The claim that the phrase "when pigs fly" was first recorded in Ben Jonson's 1616 play "The Devil is an Ass" is not accurate. There is no evidence from the…

This is for my Computer Organization & Assembly Language Class