代码

int binary_search(const register unsigned *a, register int n, register unsigned x)
{
unsigned *l=(unsigned*)a,*r=(unsigned*)a+n,mid;
while(l+1!=r){
mid=(*(unsigned*)&l+*(unsigned*)&r)>>1;
*(unsigned**)&mid<=x?l=*(unsigned**)&mid:(r=*(unsigned**)&mid);
};
return l-a;
}

评测结果