leetcode704二分法查找

代码

int two_search(int* nums,int begin,int end,int target){
    if(begin>end)
        return -1;
    int mid = (begin+end)/2;
    if(nums[mid]==target)
        return mid;
    if(nums[mid]>target){
        end = mid-1;
        return two_search(nums,begin,end,target);
    } 
    else{
        begin = mid+1;  
        return two_search(nums,begin,end,target);
    }
        
}

int search(int* nums, int numsSize, int target){
    return two_search(nums,0,numsSize-1,target);
}