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 XA-Z Databa x← → CCPS 2231 Lab3.pdf44°FMostly cloudyJSTOR Hon X E ScienceDin X PQ Representa X E Result List: Xkean.instructure.com/courses/12224/assignments/56685231:02 > Assignments}}public static int binarySearch(int[] list, int key). {// finish the binary search method here |}▬▬Connected Xpublic 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!");elseSystem.out.println("The index of the input key is " + result+ ".");O SearchaPage <Lab 3: 1-D X4b Home | ba x +> of 6DownloadGR℗i InfoZOOM+X CloseO6:42 PM2/9/2023X

Answered: public class BinarySearch { public…

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

Concept explainers

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 |
}
▬▬
Connected X
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+ ".");
O Search
a
Page <
Lab 3: 1-D X
4
b Home | ba x +
> of 6
Download
GR
℗i Info
ZOOM
+
X Close
O
6:42 PM
2/9/2023
X

Expert Solution

Step 1

The algorithm for the binary search implementation in the code is as follows:

Initialize two variables, low and high, to keep track of the range of indices being searched. low is set to 0 and high is set to the last index of the input array list.
Start a loop that continues while low is less than or equal to high.
Calculate the middle index mid of the current search range by adding low and high and dividing by 2.
Check if the value at the middle index mid is equal to the key being searched for. If it is, return the index mid as the result.
If the value at the middle index mid is less than the key, set low to mid + 1 to search the right half of the current search range.
If the value at the middle index mid is greater than the key, set high to mid - 1 to search the left half of the current search range.
If the loop terminates without finding the key, return -1 to indicate that the key was not found in the array.

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 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