Question

The following recursive method calculates 3^n:

Answer 1

//precondition: n >=0
public int power3(int n)
{
if (n == 0)
return 1;
else
{
int p = power3(n/2);
p^*=p; //multiple p by itself

if (n%2 == 1) //if n is odd,
p^*=3; //multiple p by 3

return p;
}
}