二分查找 递归与非递归

int binarysearch(int array[],int low, int high,int target){
    if(low<=high){
        int mid = (low + high)/2;
        if (array[mid]==target){
            return mid;
        }
        else if (array[mid]>target){
            binarysearch(array,low,mid-1,target);
        }
        else{
            binarysearch(array,mid+1,high),target;
        }
    }
    return  -1;
}

int binarysearch(int array[], int low,int high,int target){
    while (low<=high){
        int mid = (low+high)/2;
        if (array[mid]==target){
            return mid;
        } else if ( array[mid]<target){
            low = mid +1;
        }
        else {
            high = mid -1;
        }
    }
    return -1;
}