示例：使用递归计算功效的程序
public class Power {
public static void main(String[] args) {
int base = 3, powerRaised = 4;
int result = power(base, powerRaised);
System.out.printf("%d^%d = %d", base, powerRaised, result);
}
public static int power(int base, int powerRaised) {
if (powerRaised != 0)
return (base * power(base, powerRaised - 1));
else
return 1;
}
}输出
3^4 = 81在上面的程序中，您使用递归函数 power()计算函数 。
简而言之，递归函数幂乘以基础乘以自身，即：
3 * 3 * 3 * 3 = 81| Iteration | power() | powerRaised | result |
|---|---|---|---|
| 1 | power(3, 4) | 4 | 3 * result2 |
| 2 | power(3, 3) | 3 | 3 * 3 * result3 |
| 3 | power(3, 2) | 2 | 3 * 3 * 3 * result4 |
| 4 | power(3, 1) | 1 | 3 * 3 * 3 * 3 * resultfinal |
| Final | power(3, 0) | 0 | 3 * 3 * 3 * 3 * 1 = 81 |