binarysearch.java

public class binarysearch{

// function defined 
public static int binarysearch(int arr[],int element, int left, int right){
   if(left <= right){
      int mid = (left + right)/2;

     if(arr[mid] == element)
         return mid; 
     
     else if (arr[mid] > element)
         return binarysearch( arr, element , left , mid-1);
     
      else 
         return binarysearch( arr, element , mid+1 , right);
    

}
return -1;
}

// main function
public static void main(String args[]){
//define array
int num[] = {4,7,2,8,1,11,3};

// function call
int n = 11;
 
int index = binarysearch(num ,n, 0,num.length );
if(index == -1)
System.out.println( "The element is not present in the list.");

else
System.out.println( "The index of "+n +" is "+ index+"." );


}
}