C program to Calculate Power of a Number using recursion

Recursion : :

• Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.

• The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
• Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

Here is the source code of the C program to Calculate Power of a Number using recursion. The C Program is successfully compiled and run on a Windows system. The program output is also shown below.

SOURCE CODE : :

/*  C program to Calculate Power of a Number using recursion */

#include<stdio.h>

int i=1;
long int sum=1;
long int power(int num,int pow);

int main()
{
        int pow,num;
        long int res;
        long int power(int,int);

        printf("Enter any number :: ");
        scanf("%d",&num);

        printf("\nEnter power to the number [ %d ] :: ",num);
        scanf("%d",&pow);

        res=power(num,pow);

        printf("\n%d to the power %d [ %d ^ %d ] is :: %ld\n",num,pow,num,pow,res);

        return 0;
}

long int power(int num,int pow)
{
        if(i<=pow)
    {

                sum=sum*num;
                power(num,pow-1);

        }
        else
              return sum;
}

OUTPUT : :

/*  C program to Calculate Power of a Number using recursion */

Enter any number :: 2

Enter power to the number [ 2 ] :: 5

2 to the power 5 [ 2 ^ 5 ] is :: 32

Process returned 0

Above is the source code for C program to Calculate Power of a Number using recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .