代码

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

评测结果