(Intro to Java) Explain the answers to the below questions. include a written answer to the question using step-by-step explanation 5. Fill in the missing lines of the binarySearch method below: public static int binarySearch(double array[], double value) { int low = 0; int high = array.length - 1; while (low <= high) { int mid = (low + high)/2; if (array[mid] == value) { return _______________; } else if (________________) { //search the left half high = mid - 1; } else {//search the right half low = ________________; } } //end of while loop return -1; }
(Intro to Java)
Explain the answers to the below questions. include a written answer to the question using step-by-step explanation
5. Fill in the missing lines of the binarySearch method below:
public static int binarySearch(double array[], double value) {
int low = 0;
int high = array.length - 1;
while (low <= high) {
int mid = (low + high)/2;
if (array[mid] == value) {
return _______________;
} else if (________________) { //search the left half
high = mid - 1;
} else {//search the right half
low = ________________;
}
} //end of while loop
return -1;
}
Now, re-write the above method for an array of Strings.
Step by step
Solved in 2 steps
