代码

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

评测结果