Lab #6 Section 1 – Chapter 11 Write a program class called BinarySearch that has a static method...

Question

Lab #6
Section 1 – Chapter 11
Write a program class called BinarySearch that has a static method called Search that searches
the a
ay a for key. If key is not in the a
ay segment, then -1 is returned. Otherwise returns an
index in the segment such that key == a[index]. Precondition: a[first] <= a[first + 1]<= ... <=
a[last]. The search method takes an int a
ay, index of first number in a
ay, index of last
number in a
ay and key to search for in the a
ay.
Section 2 – Chapter 12
Write a Main program that uses the BinarySearch class you created in Section 1 to search for a
value. Your program will print key + " is at index " + result) if it finds the value or key + " is not in
the a
ay” if it does not find the value.

lab6-4x4sllct.pdf

Neha · Accepted Answer

import java.util.Arrays;
import java.util.Scanner;
public class Main{  
    public static int binarySearch(int arr[], int first, int last, int key){  
        if (last>=first){  
            int mid = first + (last - first)/2;  
            if (arr[mid] == key){  
            return mid;

Lab #6 Section 1 – Chapter 11 Write a program class called BinarySearch that has a static method called Search that searches the array a for key. If key is not in the array segment, then -1 is...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment