代码

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

评测结果