C++ 基础算法之二分查找

前提：

有序数组！

int binary_search(int* a, int len, int goal)
{
    int low = ;
    int high = len - ;
    while(low <= high)
    {
        int middle = (low + high)/;
        if(a[middle] == goal)
            return middle;
        //在左半边
        else if(a[middle] > goal)
            high = middle - ;
        //在右半边
        else
            low = middle + ;
    }
    //没找到
    return -;
}