public class BinarySearch
{
   
   public static void main (String[] args)
   {
      int[] ar = new int[1000];
      int i;
      
            
      for (i=0;i<ar.length;i++)
           ar[i] = i*10;
           
      for (i=0;i<ar.length;i++)
           System.out.println("ar[" + i+ "] = " + ar[i]);    
              
      System.out.println();
      System.out.println("\n\n750 is in position " + binarySearch(ar, 750, 0, ar.length-1));  
      System.out.println();
      System.out.println("\n\n101 is in position " + binarySearch(ar, 101, 0, ar.length-1));     
      System.out.println();
   }
  

   public static int binarySearch(int[] ar, int target, int low, int high)
   {
     int mid = (low + high) / 2;;
     System.out.println("low = " + low + " high = " + high + " mid = " + mid);
     if (low > high)
        return -1;
     else
     {
       if (ar[mid] < target) 
         return binarySearch(ar, target, mid+1, high);
       else 
         if (ar[mid] > target) 
           return binarySearch(ar, target, low, mid-1);
         else  // ar[mid] == target
           return mid;
     }
   }  
}