// cs253 lecture 1 (example 2a).
// Binary search in an array of integers.

class lec1ex2a {

   public static void main (String[] args) {

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

      int target = 11;

      boolean result = binarySearch (list, target);

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

   public static boolean binarySearch (int[] list, int target) {

      boolean result = false;
      int low = 0, high = list.length - 1, middle;
      while (low <= high) {
         middle = (low + high) / 2;
         if (list[middle] == target) {
            result = true;
            return result;
         }
         else 
            if (list[middle] < target) 
               low = middle + 1;
            else 
               high = middle - 1;     
      } 
      return result;
   }
}