More Practice with Recursion - 很简单的一个java program

就是用递归来处理整数a的n次幂~
public class Practice
{
public static int powerOf(int a, int n)
{
if(n==0)
return 1;
if ((n & 1) == 0)
{
return powerOf(a, n >> 1) * powerOf(a, n >> 1);
}
else
{
return powerOf(a, n>>1)*powerOf(a, n>>1)*a;
}
}
}