二分查找

#include <stdio.h>
#include <stdlib.h>
int binarySearch(int*, int, int, int*, int*);
int main(void)
{
    int left;
    int right;
    int array[] = {1, 5, 10, 12, 100, 666, 667, 800, 900, 1000};
    printf("%d\n", binarySearch(array, 665, 10, &left, &right));
    printf("%d %d\n", left, right);
    return 0;
}
//二分查找，如果找到则返回1，否则返回0
//left和right分别返回小于它的最大数和大于它的最小数
int binarySearch(int *array, int x, int n, int *left, int *right)
{
    int begin = 0;
    int end = n - 1;
    int middle;
    while (begin <= end)
    {
        middle = (begin + end) / 2;
        if (array[middle] == x)
        {
            *left = *right = x;
            return 1;
        }
        else if (array[middle] > x)
        {
            end = middle - 1;
        }
        else
        {
            begin = middle + 1;
        }
    }
    *left = array[begin];
    *right = array[end];
    return 0;
}