数据结构：二分法查找

顺序存放的一组整数，查找某个数的下标

int BSearch(int a[],int low, int height,int x)
{
    if (low > height)
    {
        return 0;
    }

    static int L = low,H = height;

    int tmp = (L + H -1)/2;

    if(a[tmp] == x)
        return tmp;

    if (x>a[tmp])
    {
        L = a[tmp];
        BSearch(a,L,H,x);
    }
    else
    {
        H = a[tmp];
        BSearch(a,L,H,x);
    }


}