代码

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

评测结果