c++用遞歸方式實現二分法查找

bool binary_search(std::vector<int> &sort_array,int begin,int end,int target){
    if(begin>end){
    return false;
    }

    int mid = (begin + end )/2;

    if(target== array_sort[mind]){
        return true;
    }

    if(target > sort_array[mid]){
        binary_search(sort_array,begin,mid-1,target);
    }
    if(target < sort_array[mid]){
        binary_search(sort_array,mid+1, end,target);
    }
}