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.

Question

Want to see the full answer?

Answer 1

Question

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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

1. Write a generic method named array_prod() that takes an array of a generic type are returns the product of the values in the elements in the array. Make sure that the generic type extends the Number class. The Number class is defined in the java.lang package. 2. Complete the main() method to find the products of the elements in the provided arrays. Print the results in the main method using 3 decimals.

(Java) (data structure) write an entire generic hashing program with a custom hashcode function and a Test class all classes should be generic and the program should have these methods : 1. rehash (to rehash when the array is 0.75 full) 2. rehash insert ( to insert items from the old array to the new larger one) 3. put (to insert into the hashtable) 4.getAll(to get all the items on the table you should override toString) 5. delete (to delete an item from the table) 6. custom hashcode function for T type

Excercise: Listed next is the skeleton for a class named City. Each city has a name and temperature: public class City { private String cityName; private int temperature; } Flesh out the class with appropriate accessors, constructors, and mutators. Next, modify the class so that it implements the Comparable interface. The order between instances of the City class depends on the temperature. Test your class by creating an array of sample cities and sort them in an ascending order using Arrays.sort Notes: The language used for this question is Java. So far, this is the City class after fleshing it out: public class City implements Comparable<City> {private String cityName;private double temperature; public City() {} public City(String cityName, double temperature) {this.cityName = cityName;this.temperature = temperature;} public String getCityName() {return cityName;} public double getTemperature() {return temperature;} public void setName(String cityName)…