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 else System.out.println("The } found!"); index of the input key is " + result+ "."); } public static int binarySearch(int[] list, int key.). { // finish the binary search method here | } TASK 4: 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.
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 else System.out.println("The } found!"); index of the input key is " + result+ "."); } public static int binarySearch(int[] list, int key.). { // finish the binary search method here | } TASK 4: 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.
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
Related questions
Question
Given a pre-sorted (in ascending order) array and a key, output the index of the key. Implement
the Binary Search in Eclipse by creating a binarySearch method, and ensure it runs without errors.
![Learning C X
A-Z Databa x
← → C
CPS 2231 Lab3.pdf
44°F
Mostly cloudy
JSTOR Hon X E ScienceDin X PQ Representa X E Result List: X
kean.instructure.com/courses/12224/assignments/56685
231:02 > Assignments
}
}
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!");
else
System.out.println("The index of the input key is " + result+ ".");
Connected X
H
O Search
Page <
a
Lab 3: 1-D X
TASK 4: 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.
b Home | ba x +
4 > of 6
Download
GR
i Info
ZOOM
+
x
X Close
3:37 PM
2/9/2023
X](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2ae76079-938b-4b5d-8ceb-1dfbc10f88ce%2F4a779791-584f-4fc3-bb5b-76bd82f2b390%2Fdei26cl_processed.png&w=3840&q=75)
Transcribed Image Text:Learning C X
A-Z Databa x
← → C
CPS 2231 Lab3.pdf
44°F
Mostly cloudy
JSTOR Hon X E ScienceDin X PQ Representa X E Result List: X
kean.instructure.com/courses/12224/assignments/56685
231:02 > Assignments
}
}
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!");
else
System.out.println("The index of the input key is " + result+ ".");
Connected X
H
O Search
Page <
a
Lab 3: 1-D X
TASK 4: 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.
b Home | ba x +
4 > of 6
Download
GR
i Info
ZOOM
+
x
X Close
3:37 PM
2/9/2023
X
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education