public class BinSearch {

public int search(int search, int[] array) {

          return recursivSearch(array, 0, array.length-1, search);
}


private int recursivSearch(int[] array, int start, int end, int search) {



      if (end<start) {
    	  return -1;
      }
      int middle = (start + end) / 2;
        if (search < array[middle]) {
          return recursivSearch(array, start, middle-1, search);
        }
        else if (search > array[middle]) {
          start = middle + 1;
          return recursivSearch(array, middle+1, end, search);
        }
        else {
          System.out.println(middle);
          return middle;
       }
}
}