Cautare binara recursiv/iterativ

int caut_bin(int v[100], int st, int dr, int x) // recursiv
{
    if(st <= dr)
    {
        int mij;
        mij = (st + dr) / 2;
        if(x == v[mij])
            return 1;
        else if(x < v[mij])
            caut_bin(v, st, mij - 1, x);
        else caut_bin(v, mij + 1, dr, x);
    }
    else return 0;
}

int caut_bin(int v[100], int st, int dr, int x) // iterativ
{
    int mij;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(v[mij] == x)
            return 1;
        else
            if(x > v[mij])
                st = mij + 1;
            else
                dr = mij - 1;
    }
    return 0;
}
    }
}