左右边界二分查找

二分查找虽然是个基础算法，但是要考虑的还是蛮多的
二分的前提是避免死循环，所以边界迭代的时候不能出现重复的值，由于整数类型的除法是向下取整，所以当left = right - 1的是时候就会造成mid == left 如果边界迭代是left = mid的话代码就会陷入死循环，所以边界迭代最好写成下面的形式，再根据不同的需求变更迭代的判断条件

left = mid + 1;
right = mid;

1.查找小于等于

int BinarySearch(int value, int left, int right){
	right +=1;
    while(left < right){
        cout<< left << " " << right <<endl;
        int mid = (left + right) >> 1;
        if (value == numbers[mid]){
            return mid;
        }else if (numbers[mid] < value){
            left = mid + 1;
        }else if (value < numbers[mid]){
            right = mid;
        }
    }
    return left - 1;
}

1.查找大于等于

int BinarySearch(int value, int left, int right){
	right +=1;
    while(left < right){
        cout<< left << " " << right <<endl;
        int mid = (left + right) >> 1;
        if (value == numbers[mid]){
            return mid;
        }else if (numbers[mid] < value){
            left = mid + 1;
        }else if (value < numbers[mid]){
            right = mid;
        }
    }
    return left;
}