C语言二分查找函数

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

主要思路:1.定义初始数组的首尾两端的索引;2.获取数组中间的索引;3.判断与目标值的大小;