Class BinarySearch

Java/Array/BinarySearch.java:46–89

import java.util.Scanner;

public class BinarySearch {

    public static int binarySearch(int [] arr, int x) {
        int n = arr.length;
        int start = 0;
        int end = n - 1;

        while ( start <= end) {
            int mid = (start + end)/2;

            if ( arr[mid] > x) {
               end = mid - 1;
            } else if (arr[mid] < x) {
                start = mid + 1;
            } else if ( arr[mid] == x) {
                return mid;
            }
        }
        return -1;
    }


    public static int [] takingInput() {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the length of the Array: ");
        int n = sc.nextInt();
        int [] arr = new int[n];

        System.out.println("Enter the elements of the array:" );
        for (int i = 0; i < n; i++) {
            arr[i]  = sc.nextInt();
        }
        return arr;
    }

    public static void main(String[] args) {
        int [] arr = takingInput();
        System.out.println("Enter the required number: ");
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int n = binarySearch(arr, a);
        System.out.println("Index of the required number is: " +n);
    }
}