How to calculate power of three using C#?

Calculating the power of a number in C# can be done using recursion, iteration, or built-in methods. This article demonstrates how to calculate powers with a focus on raising numbers to the power of 3, though the methods work for any exponent.

Syntax

Following is the syntax for a recursive power function −

static long power(int baseNumber, int exponent) {
    if (exponent != 0) {
        return (baseNumber * power(baseNumber, exponent - 1));
    }
    return 1;
}

Following is the syntax using Math.Pow() method −

double result = Math.Pow(baseNumber, exponent);

How Recursive Power Calculation Works

The recursive approach breaks down the power calculation into smaller subproblems. For example, to calculate 5³, the function works as follows −

Recursive Power Calculation: 5³ power(5, 3) 5 × power(5, 2) power(5, 2) 5 × 25 = 125 25 (returns)

The recursive calls continue until the exponent reaches 0, at which point the function returns 1 (base case).

Using Recursive Approach

Example

using System;

public class PowerCalculator {
    public static void Main(string[] args) {
        int baseNumber = 5;
        int exponent = 3;
        long result;
        
        result = CalculatePower(baseNumber, exponent);
        Console.WriteLine($"{baseNumber}^{exponent} = {result}");
        
        // Test with different values
        Console.WriteLine($"2^3 = {CalculatePower(2, 3)}");
        Console.WriteLine($"4^3 = {CalculatePower(4, 3)}");
    }
    
    static long CalculatePower(int baseNumber, int exponent) {
        if (exponent != 0) {
            return (baseNumber * CalculatePower(baseNumber, exponent - 1));
        }
        return 1;
    }
}

The output of the above code is −

5^3 = 125
2^3 = 8
4^3 = 64

Using Iterative Approach

Example

using System;

public class IterativePower {
    public static void Main(string[] args) {
        int baseNumber = 3;
        int exponent = 3;
        
        long result = CalculatePowerIterative(baseNumber, exponent);
        Console.WriteLine($"Iterative: {baseNumber}^{exponent} = {result}");
        
        // Compare with Math.Pow
        double mathResult = Math.Pow(baseNumber, exponent);
        Console.WriteLine($"Math.Pow: {baseNumber}^{exponent} = {mathResult}");
    }
    
    static long CalculatePowerIterative(int baseNumber, int exponent) {
        long result = 1;
        for (int i = 0; i < exponent; i++) {
            result *= baseNumber;
        }
        return result;
    }
}

The output of the above code is −

Iterative: 3^3 = 27
Math.Pow: 3^3 = 27

Comparison of Approaches

Method Time Complexity Space Complexity Advantages
Recursive O(n) O(n) Clean, easy to understand
Iterative O(n) O(1) Memory efficient, no stack overflow risk
Math.Pow() O(1) O(1) Built-in, optimized, handles floating-point

Conclusion

Calculating powers in C# can be accomplished through recursive functions, iterative loops, or the built-in Math.Pow() method. The recursive approach is educational and intuitive, while the iterative method is more memory-efficient for large exponents.

Updated on: 2026-03-17T07:04:35+05:30

399 Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements