代码

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

评测结果