JAVA 折半查找

 
    public static int search(int[] a,int b){
        for (int i=0;i=right){
            middle=(right+left)/2;
            if(b==a[middle]){
                return middle;
            }
            else if(ba[middle]){
                right=middle+1;
            }
        }
       return -1;
    }