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.

Question

Want to see the full answer?

Answer 1

Question

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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) void isEmpty() This method will return true if the linked list is empty, otherwise return false. void clear() This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.

Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) int count(int num) This will return the count of the instances of the element num in the list. In the linked list in removeAll method, having the method count(10) will return 3 as there are three 10's in the linked list. Additionally, you are to implement these methods: bool move(int pos1, int pos2) This method will move the element at position pos1 to the position specified as pos2 and will return true if the move is successful. This will return false if either the specified positions is invalid. In the example stated, operating the method move(1, 3) will move the 1st element and shall now become the 3rd element. The linked list shall now look like: 30 -> 40 -> 10 -> 50 int removeTail() This method will remove the last element in your linked list and return the said element. If the list is empty, return 0. You can use the…

(Implement set operations in MyList)(JAVA) Please use class name: Exercise_01 The implementations of the methods addAll, removeAll, retainAll, toArray(), and toArray(T[]) are omitted in the MyList interface. Implement these methods. Test your new MyList class using the code at https://liveexample.pearsoncmg.com/test/Exercise24_01.txt. Sample Output: Enter five strings for array name1 separated by space: TomGeorgePeterJeanJaneEnter five strings for array name2 separated by space: TomGeorgeMichaelMichelleDanielEnter two strings for array name3 separated by space: TomPeterlist1:[Tom, George, Peter, Jean, Jane]list2:[Tom, George, Michael, Michelle, Daniel]After addAll:[Tom, George, Peter, Jean, Jane, Tom, George, Michael, Michelle, Daniel] list1:[Tom, George, Peter, Jean, Jane]list2:[Tom, George, Michael, Michelle, Daniel]After removeAll:[Peter, Jean, Jane] list1:[Tom, George, Peter, Jean, Jane]list2:[Tom, George, Michael, Michelle, Daniel]After retainAll:[Tom, George] list1:[Tom, George,…