How to write power(x,y) i.e. x^y recursively?

Question

How to implement the function power(int x, int y) recursively.

Comments

if I understood your question correctly, you are looking a program for X^y rather than just x*y.

Answer 1

int power(int x, int y)
{
   if (y>0)
      return (x * power(x, y-1));
   else
      return 1;
}

Comments

int power(int x, int y)
{
   if (y==1)
      return X;
   else
      return (x * power(x, y-1));
}

save memory for one stack :) :P