binarySearch

import java.util.Arrays;

import static java.util.Arrays.binarySearch;

public class main {
    public static void main(String[] args) {

        //This is binary search
        
        int[] array=new int[100];

        for(int i=0;i<array.length;i++){
            array[i]=i+1;
        }

        
        //        There is inbuilt method 
//                int index= Arrays.binarySearch(array,75);



        int index= binarySearch(array,75);
        System.out.println("Target found at : "+index);


    }

    private static int binarySearch(int[] array,int target){
        int low=0;
        int high=array.length-1;

        while(low<=high){

            int middle=low+(high-low)/2;
            int value=array[middle];
            System.out.println(value);
            if(target>value)low=middle+1;
            else if(target<value)high=middle-1;
            else if(target==value) {


                return value;
            }

        }


        return -1;
    }

}