代码

int binary_search(const unsigned* a, int n, unsigned x) {
    int left = 0, right = n;
    while(left != right) {
        int mid = (left + right) / 2;
        if(a[mid] < x) left = mid + 1;
        else right = mid;
    }
    return left;
}

评测结果