public class BinSearch {

  public static int search(int search, int[] array, int start, int end, int middle) {

      start = 0;
      end = array.length - 1;


     if (start<=end)
     {
      middle = (start + end) / 2;

      if (search < array[middle]) {
          end = middle - 1;
          return search(search, array, start, end, middle);
      }
      else if (search > array[middle]) {
    	  start = middle + 1;
          return search(search, array, start, end, middle);
      }
      else if (search == array[middle]) {
          return middle;
      }
     }
      else {
    	  System.out.println("Nummer nicht enthalten");
      }
   }

}