binarySearch.java

public class BinarySeach {
            public static int binarySearch(int array[], int target) {
                int start = 0;
                int end  =  array.length-1; 
                while(start<=end) {
                    int mid  =  Math.round(start+end)/2;
                    if(array[mid] == target ) {
                       return mid;
                    } else if(array[mid]< target) {
                        start= mid+1;
                    } else {
                        end = mid-1;
                    }
                }

                return -1;
            }
            public static void main(String[] args) {
                int array[] =  {18,19,23,45,67,89,98,102,123,456};

                int index =  binarySearch(array, 123);
                if(index==-1) {
                    System.out.println("Element not found");
                } else {
                    System.out.println("Element found: " + index);
                }
                
            
            }
}