binary_search.java

import java.util.Scanner;
import java.util.Arrays;

class binarySearch{

    int search(int arr[], int n, int key){
        int low = 0,high = n-1;
        while(low<=high){
            int mid = low + (high-low)/2;
            if(arr[mid]==key){
                return mid;
            }
            else{
                if(arr[mid]>key){
                    high = mid-1;
                }
                else{
                    low = mid +1;
                }
            }
        }
        return -1;
    }
}

public class binary_search {
        public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter limit of array: ");
        int n = sc.nextInt();
        int arr[] = new int[n];
        for(int i=0; i<n; i++){
            arr[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.print("Enter Search element: ");
        int k = sc.nextInt();
        binarySearch b = new binarySearch();
        int res = b.search(arr,n,k);
        if(res==-1){
            System.out.println("Not Found");
        }
        else{
            System.out.println("found at pos:" + res);
        }
        sc.close();
    }   
}