public class source {

     public int binary_sort(int[] array, int item) {

         int len = array.length;

         int min = 0; //定义查找范围的开始

         int max = len - 1; //定义查找范围的结尾

         while(max > min) { //这里不能等于,不然可能死循环

             if(array[min+(max-min)/2] == item) {

                 return (int)min+(max-min)/2;

             }

             else if(array[min+(max-min)/2] > item) {

                 max = min+(max-min)/2;

             }

             else if(array[min+(max-min)/2] < item) {

                 min = min+(max-min)/2;

             }

         }

         return -1;

     }

     public static void main(String[] args) {

         int[] a = {1,2,3,4,5,6,7,8,9,10};

         int n = -1;

         source sou = new source();

         System.out.println(sou.binary_sort(a, n));

     }

 }

 int binary_sort(int array[], int length, int value)

 {

     if(NULL == array ||  == length)

         return -;  

     int start = ;

     int end = length -;  

     while(start <= end){  

         int middle = start + ((end - start) >> );

         if(value == array[middle])

             return middle;

         else if(value > array[middle]){

             start = middle + ;

         }else{

             end = middle -;

         }

     }  

     return -;

 }