How to calculate Power of a number using recursion in C#?

To calculate power of a number using recursion, try the following code.

Here, if the power is not equal to 0, then the function call occurs which is eventually recursion −

if (p!=0) {
   return (n * power(n, p - 1));
}

Above, n is the number itself and the power reduces on every iteration as shown below −

Example

 Live Demo

using System;
using System.IO;

public class Demo {
   public static void Main(string[] args) {
      int n = 5;
      int p = 2;
      long res;
      res = power(n, p);
      Console.WriteLine(res);
   }

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

Output

25