public class BinSearch {

	int start;
	int end;
	int middle;
	int search;
	int[] array;

  public int search() {
      start = 0;
      end = array.length - 1;
      if (start<=end) {
      return recursivSearch();
      }
      else {
    	  return -1;
      }
}

private int recursivSearch() {

    middle = (start + end) / 2;

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

}