代码

int binary_search(const unsigned *a, int n, unsigned x)
{
        int l = 1, r = n;
	while (l + 1 < r)
        {
           int mid = l + r >> 1;
           if (a[mid] < x) l = mid;
            else r = mid;
        }
        return r;
}

评测结果