BinarySearch ob = new BinarySearch(); 

        int arr[] = { 2, 3, 4, 10, 40 }; 

        int n = arr.length; 

        int x = 10; 

        int result = ob.binarySearch(arr, 0, n - 1, x); 

        if (result == -1) 

        return;

        else 

        System.out.println("Element found at index " + result); 

    }

    

        int binarySearch(int arr[], int l, int r, int x)  {

            if (r >= l) { 

            int mid = l + (r - l) / 2; 

            if (arr[mid] == x) 

            return mid; 

            if (arr[mid] > x) 

            return binarySearch(arr, l, mid - 1, x); 

            return binarySearch(arr, mid + 1, r, x); 

            } 

            return -1; 

        int size,counter,search,arr[],low,high,mid;

        Scanner n = new Scanner (System.in);

        System.out.println("Enter number of elemnts :");

        size = n.nextInt();

        arr = new int [size];

        System.out.println(" Enter " + size + "intergers");

        for (counter = 0 ; counter<size  ; counter++)

            arr[counter] = n.nextInt();

        System.out.println("Enter the search value");

        search = n.nextInt();

        low = 0;

        high = size - 1 ;

        mid = low + (high - low ) / 2 ;

        while (low <= mid) {

            if (arr[mid] <search )

                low = mid +1;

            else if (arr[mid] == search) {

                System.out.println("found at location "+ (mid+1) + ".");

                break;

            }

            else {

                high = mid - 1 ;

            }
            mid = (low + high) / 2;

        }