代码

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

评测结果