算法提炼--递归(4)

//    二分查找递归写法
    static int  binary(int a[],int low,int heigh,int target){
        if(low>heigh){
            return -1;
        }
        int mid = low+((heigh-low)>>1);
        int midValue = a[mid];
        if(midValue<target){
            return binary(a,mid+1,heigh,target);
        }else if(midValue>target){
            return binary(a,low,mid-1,target);
        }else{
            return mid;
        }
    }