Recursion Questions

[azntrindo]

I am stuck on a question about recursion


Two non-negative integers  x and y are equal  if either:
Both are 0, or
x-1 and y-1 are equal 
Write a bool -function named  equals  that recursively determines whether  its two int  parameters  are equal  and returns true  if they are and false  otherwise.

so far here is what i think it should be

bool equals (int x, int y)
{
if (x && y == 0)
	return true;
else if (x == y)
	return true;
else
return equals; false;
}

but myprogramminglab says its wrong can somebody help?

[cire]

if (x && y == 0) is equivalent to: if ((x) && (y == 0)) which probably isn't what you meant to say.

bool equals(int x, int y)
{
    if ( x == 0 || y == 0 ) 
        return x == 0 && y == 0 ;

    return ?? ;
}

[sanddy1911]

The code is x>=0 and y>=0 and x==y can be implement like this

inline bool equals (int x, int y)
{
return ((x==y) && (x>=0&&y>=0));
}

Recursion

bool equals (int x, int y)
{
if(x==0&&y==0) return 1;
if(x>0&&y>0) return equals (x-1, y-1);
return 0;
}

[upX86]

How does recursion come in to picture?
It is straight forward, I think you are missing some part of question.

[sanddy1911]

Ya i was missing but now its Recursive.