Join our newsletter for the latest updates.
Java Program to calculate the power using recursion

Java Program to calculate the power using recursion

In this program, you'll learn to calculate the power of a number using a recursive function in Java.

To understand this example, you should have the knowledge of the following Java programming topics:


Example: Program to calculate power using recursion

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;
    }
}

Output

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
Execution steps
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