代码

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

评测结果