C Program to Find Power of a Number using Recursion

This is a C Program to find power of a number using recursion.

The following C program, using recursion, finds the power of a number.

The power of a number is the number multiplied to itself for the number of times it has been raised to Eg: 7³ is 343

Here is the source code of the C program to find an element in a linked list. The C Program is successfully compiled and run on a Linux system. The program output is also shown below.

/*
 * C Program to find Power of a Number using Recursion
 */
#include <stdio.h>
 
long power (int, int);
 
int main()
{
    int pow, num;
    long result;
 
    printf("Enter a number: ");
    scanf("%d", &num);
    printf("Enter it's power: ");
    scanf("%d", &pow);
    result = power(num, pow);
    printf("%d^%d is %ld", num, pow, result);
    return 0;
}
 
long power (int num, int pow)
{
    if (pow)
    {
        return (num * power(num, pow - 1));
    }
    return 1;
}

In this C Program, we are reading a number and its power using ‘num’ and ‘pow’ variables respectively. The power() function is used to find the power of a number using recursion.

The power of a number is the number multiplied to itself for the number of times it has been raised to Eg: 7³ are 343. Using if condition statement, compute the power of a number. Multiply the number by itself by number of times power raised and return the value. Print the power of a number using printf statement.

 
$ cc pgm30.c
$ a.out
Enter a number: 456
Enter it's power: 3
456^3 is 94818816

Sanfoundry Global Education & Learning Series – 1000 C Programs.

Here’s the list of Best Reference Books in C Programming, Data-Structures and Algorithms