代码

int binary_search(const unsigned *a, int n, unsigned x)
{const unsigned *l=a,*r=a+n;
while(true){
const unsigned *m=l+((r-l)>>1);
if(*m==x)return m-a;
if(*m>x) l=m+1;
else r=m-1;
}
}

评测结果