代码

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

评测结果