English | 简体中文 | 繁體中文 | Русский язык | Français | Español | Português | Deutsch | 日本語 | 한국어 | Italiano | بالعربية
Dans ce programme, vous apprendrez à utiliser les fonctions récursives en Java pour calculer la puissance des nombres.
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; } }
When the program is run, the output is:
3^4 = 81
In the above program, you use the recursive function power() to calculate the power.
In simple terms, the recursive function multiplies the base with itself to obtain the number of times to be raised, that is:
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 |