代码

int binary_search(const unsigned *a, int n, unsigned x)
{
        int hj;
        while(a[hj] != x){
                if(n % 2 == 0)
                        hj = n / 2;
                if(n % 2 == 1)
                        hj = n / 2 + 1;
                if(x > a[hj])
                        n = n - n / 2;
                if(x < a[hj])
                        n = n / 2;
        }
        return hj;
}

评测结果