代码

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

评测结果