// Binary search -- recursive version


class BinSearchR {

   public static void main (String[] args) {

      int[] list = {1, 2, 5, 7, 9, 11, 15};

      int target = 11;

      boolean result = binarySearchR (list, target, 0, list.length - 1);

      if (! result)
         System.out.println ("Target not found -- unsuccessful search.");
      else
         System.out.println ("Target found -- successful search.");
   }


public static boolean binarySearchR (int[] list, int target, int low, int high) {

      int middle = (low + high) / 2;
         if (list[middle] == target) 
            return true;
         else 
            if (low > high)
               return false;
            else
               if (list[middle] < target)
                  return binarySearchR (list, target, middle+1, high);
               else 
                  return binarySearchR (list, target, low, middle-1);
   }
}