Create a BinarySearch2.java to implement the binary search on a descending array. Create a method for the binary search: “binarySearch2” in BinarySearch2.java. Implement your own code in Eclipse. ensure it runs without errors. Learning X← → CA-Z Data X44°FMostly cloudyCPS 2231 Lab3.pdfJSTOR H XE Science X PQ Represer Xkean.instructure.com/courses/12224/assignments/56685231:02 > AssignmentsB9}}else|▬▬E Result Li Xpublic class BinarySearch2 [{public static void main(String[] args) {int[] myList = {20, 12, 10, 7, 5, 3, 2};int result = binarySearch2 (myList, 20);if (result == -1)System.out.println("Not found!");System.out.println("The index of the input key is " + result+ ".");O SearchConnect X}public static int binarySearch2 (int[] list, int key) {// finish the binary search in descending order array here.Lab 3: 1- X b Success xaPage <4 > of 6New Tab x +DownloadROi InfoZOOM+X Close4x O12:07 AM2/9/2023X Learning X← → CA-Z Data X44°FMostly cloudyCPS 2231 Lab3.pdfJSTOR H XE Science X PQ Represer Xkean.instructure.com/courses/12224/assignments/56685231:02 > AssignmentsHint:E Result Li XIn the ascending order case, our logic is as follows:int midif (key list [mid])(low + high) / 2;O SearchConnect Xhigh = mid - 1;else if (key == list [mid])return mid;elselow mid + 1;In the descending order case, what should our logic be like?median is the average of the two middle valuesIaLab 3: 1- X b Success xPage <TASK 5: Write a Java program to find the median of all elements in an array of integers. Themedian is the middle value in an ordered set of numbers. If the number of elements is even, the5of 6New Tab x +Download......ROi InfoZOOM +X Close4x O12:07 AM2/9/2023X

Answered: public class BinarySearch2{ public…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Create a BinarySearch2.java to implement the binary search on a descending array. Create a
method for the binary search: “binarySearch2” in BinarySearch2.java. Implement your own code
in Eclipse. ensure it runs without errors.

Learning X
← → C
A-Z Data X
44°F
Mostly cloudy
CPS 2231 Lab3.pdf
JSTOR H XE Science X PQ Represer X
kean.instructure.com/courses/12224/assignments/56685
231:02 > Assignments
B
9
}
}
else
|
▬▬
E Result Li X
public class BinarySearch2 [{
public static void main(String[] args) {
int[] myList = {20, 12, 10, 7, 5, 3, 2};
int result = binarySearch2 (myList, 20);
if (result == -1)
System.out.println("Not found!");
System.out.println("The index of the input key is " + result+ ".");
O Search
Connect X
}
public static int binarySearch2 (int[] list, int key) {
// finish the binary search in descending order array here.
Lab 3: 1- X b Success x
a
Page <
4 > of 6
New Tab x +
Download
RO
i Info
ZOOM
+
X Close
4x O
12:07 AM
2/9/2023
X

Expert Solution

Step 1

Program Approach:-

1. Create the class BinarySearch2

2. Declare and initialize the array whose name is mylist

3. Call the function binarysearch2(mylist, 20)

4. Display the output

5. Create the user-defined function whose name is binarysearch2(int[] list, int key)

Declare and initialize the variable
int low1=0
int high1=list.length-1
Use the while loop to check the condition high1>=low1 when condition is true then go to step a otherwise go to step g
a) mid1=(low1+high1)/2
b) check the condition key<list[mid1] when condition is true then go to step c otherwise go to step d
c) low1 = mid1+1
d) check the condition key == list[mid1] when condition is true then go to step e otherwise go to step f
e) return mid1
f) high1=mid1-1
g)return -1