Binary Search in descending order We have learned and practiced the implementation of the binary search approach that works on an array in ascending order. Now let’s think about how to modify the above code to make it work on an array in descending order. Learning XA-Z Data X← → CCPS 2231 Lab3.pdf44°FMostly cloudyJSTOR H XE Science X PQ Represer Xkean.instructure.com/courses/12224/assignments/56685231°02 > Assignments}}elseE Result Li X}public static int binarySearch(int[] list, int key). {// finish the binary search method here |▬▬▬public class BinarySearch {public static void main(String[] args) {int[] myList = {1, 2, 3, 7, 10, 12, 20);int result binarySearch (myList, 20);if (result == -1)System.out.println("Not found!");System.out.println("The index of the input key is " + result+ ".");TASK 4: Binary Search in descending orderO SearchConnect XaCALALALab 3: 1- X b Success x#Page <4> of 6New Tab x +DownloadR=Ji InfoZOOM +JX Close4x O12:03 AM2/9/2023X

PROGRAM STRUCTURE: Start the definition of function to perform the binary search on the sorted…

Answered: Binary Search in descending order We…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Binary Search in descending order
We have learned and practiced the implementation of the binary search approach that works on
an array in ascending order. Now let’s think about how to modify the above code to make it work
on an array in descending order.

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

Expert Solution

Step 1

PROGRAM STRUCTURE:

Start the definition of function to perform the binary search on the sorted array in descending order.
Declare and initialize the required variables.
Use the loop to check whether the value of start is less than end.
Calculate the value of mid.
Check using the if condition that whether the searched element is equal to the array at mid index.
Return the value as -1 when the element is not found.
Start the definition of main function.
Declare the array.
Calculate the value of length of the array.
Call the function and display the result.

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions