代码

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

评测结果