Cautare binara

int n,x,v[10],m;
int caut(int s, int d)
{
    if(s>d)
        return -1;
    else
        {
            m =(s+d)/2;
            if (x==v[m])
                return m;
            if (x<v[m])
                return caut(s,m-1);
            else
                return caut(m+1,d);
        }
}

int cb3(int *v, int x, int st, int dr) {
    if (st > dr) {
        return -1;
    }
    else {
        int mij1 = (st + dr) / 3, mij2 = (st + dr)*0.66;
        if (x == v[mij1]) return mij1;
        if (x == v[mij2]) return mij2;

        if (x < v[mij1]) return cb(v, x, st, mij1 - 1);
        if (x > v[mij1] && x < v[mij2]) return cb(v, x, mij1 + 1, mij2 - 1);
        if (x > v[mij2]) return cb(v, x, mij2 + 1, dr);
    }
}