Example: Program to calculate the power using recursion

1. public class Power {
3. public static void main(String[] args) {
4. int base = 3, powerRaised = 4;
5. int result = power(base, powerRaised);
7. System.out.printf("%d^%d = %d", base, powerRaised, result);
8. }
10. public static int power(int base, int powerRaised) {
11. if (powerRaised != 0)
12. return (base * power(base, powerRaised - 1));
13. else
14. return 1;
15. }
16. }

When you run the program, the output will be:

3^4 = 81

In the above program, you calculate the power using a recursive function power().

In simple terms, the recursive function multiplies the base with itself for powerRaised times, which is:

3 * 3 * 3 * 3 = 81