代码

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

评测结果