二分查找

好久没练手，突发奇想写了个二分查找，结果发现各种bug，果然代码还是得随时写着。。

贴上代码纪念一下

#include <cstdio>
#include <algorithm>

using namespace std;

int binarySearch(int a[], int n, int key)
{
    int left = 0, right = n - 1;

    while(left <= right)
    {
        int mid = left + ((right - left) >> 1);
        if(a[mid] > key)
        {
            right = mid - 1;
        }
        else if(a[mid] < key)
        {
            left = mid + 1;
        }
        else
        {
            return mid;
        }
    }
    return -1;
}

int main()
{
    int arr[100];
    int n = 0;
    int temp;
    FILE* fp = fopen("data.txt", "r");
    while(~fscanf(fp, "%d", &temp))
    {
        arr[n++] = temp;
    }
    sort(arr, arr + n - 1);
    int rst = binarySearch(arr, n - 1, arr[n - 1]);
    if(rst >= 0)
    {
        printf("%d\n", rst);
    }
    else
    {
        printf("未查到该数字\n");
    }
    return 0;
}