Two points series

Ascending binary search

int search(int* nums, int numsSize, int target){
    int start=0;
    int end=numsSize-1;
    while(start<=end)
    {
        int mid=(start+end)/2;
        if(nums[mid]==target)
            return mid;
        if(nums[mid]<target)
            start=mid+1;
        if(nums[mid]>target)
            end=mid-1;
    }
    return -1;
}