代码

int binary_search(const unsigned *a, int n, unsigned x)
{
unsigned *p=(unsigned*)(a)+n;
	for(int i = 1<<26; i ; i>>=1){
unsigned *q=p-i;
		if(q>= a&&(x<=*q))p=q;
}
	return p-a;
}

评测结果