public int binarySearch(int[]array, int num) {int low = 0;//low rangeint high = array.length -1; //high range int mid; //mid rangewhile () //while low is less than or equal to high{mid = ; //set middle range to be (low + high) /2if () { //if the array in the middle range = input number//return mid range}elseif () { //if the array in the middle range > input number//set the high value to be the mid value minus 1}else{//set low value to be mid value plus one} }//return -1 here because that would mean that the number is not found in the loop} Complete the following binary search method. Find the number num in the array array.Return -1 if the number is not found. You may assume the array is properly ordered.Examples:binarySearch ({1,4,7},7) -> 2binarySearch({2,6,6,8,80},6) -> 2 Your Answer:1 public int binarySearch(int[ ]array, int num) {int low = 0;3//low rangeint high - array.length -1; //high rangeint mid; //mid range46.while ()//while low is less than or equal to high7{8.mid = ; //set middle range to be (low + high) /2if () { //if the array in the middle range = input number//return mid range9.10111213else14if () { //if the array in the middle range > input number15//set the high value to be the mid value minus 11617}18else19{20//set low value to be mid value plus one212223}24//return -1 here because that would mean that the number is not found in the loop25 }26H H N N N N N N N

Compare num with the mid element. If num matches with middle element, we return the mid location.…

Answered: public int binarySearch(int[]array, int…

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

public int binarySearch(int[]array, int num) {
int low = 0;
//low range
int high = array.length -1; //high range
int mid; //mid range
while () //while low is less than or equal to high
{
mid = ; //set middle range to be (low + high) /2
if () { //if the array in the middle range = input number
//return mid range

}
else
if () { //if the array in the middle range > input number
//set the high value to be the mid value minus 1

}
else
{
//set low value to be mid value plus one

}
}
//return -1 here because that would mean that the number is not found in the loop
}

Complete the following binary search method. Find the number num in the array array.Return -1 if the number is not found. You may assume the array is properly ordered.
Examples:
binarySearch ({1,4,7},7) -> 2
binarySearch({2,6,6,8,80},6) -> 2

Your Answer:
1 public int binarySearch(int[ ]array, int num) {
int low = 0;
3
//low range
int high - array.length -1; //high range
int mid; //mid range
4
6.
while ()
//while low is less than or equal to high
7
{
8.
mid = ; //set middle range to be (low + high) /2
if () { //if the array in the middle range = input number
//return mid range
9.
10
11
12
13
else
14
if () { //if the array in the middle range > input number
15
//set the high value to be the mid value minus 1
16
17
}
18
else
19
{
20
//set low value to be mid value plus one
21
22
23
}
24
//return -1 here because that would mean that the number is not found in the loop
25 }
26
H H N N N N N N N

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

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