amp-web-push-widget button.amp-subscribe { display: inline-flex; align-items: center; border-radius: 5px; border: 0; box-sizing: border-box; margin: 0; padding: 10px 15px; cursor: pointer; outline: none; font-size: 15px; font-weight: 500; background: #4A90E2; margin-top: 7px; color: white; box-shadow: 0 1px 1px 0 rgba(0, 0, 0, 0.5); -webkit-tap-highlight-color: rgba(0, 0, 0, 0); } .amp-logo amp-img{width:190px} .amp-menu input{display:none;}.amp-menu li.menu-item-has-children ul{display:none;}.amp-menu li{position:relative;display:block;}.amp-menu > li a{display:block;} /* Inline styles */ ins.acss263b2{display:block;}div.acss21998{clear:both;float:left;margin:0 0 20px 0;max-width:100%;}ins.acss6cf41{display:block;text-align:center;}div.acss138d7{clear:both;}div.acssf5b84{--relposth-columns:3;--relposth-columns_m:2;--relposth-columns_t:2;}div.acssd772c{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2019/07/sumtwonum.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss6bdea{color:#333333;font-family:Arial;font-size:12px;height:75px;}div.acssc61bb{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/plugins/related-posts-thumbnails/img/default.png) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acssa6ff8{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2019/03/evenoddarray.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss2c8d6{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2021/04/divide1.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}a.acss9bfd5{font-size:14.52427184466pt;}a.acssc37f8{font-size:16.427184466019pt;}a.acss29e97{font-size:16.631067961165pt;}a.acss361c8{font-size:17.174757281553pt;}a.acss51c7b{font-size:20.029126213592pt;}a.acssa2e10{font-size:20.097087378641pt;}a.acss5dd67{font-size:21.728155339806pt;}a.acssf0e8e{font-size:12.077669902913pt;}a.acss759e3{font-size:17.922330097087pt;}a.acss0abf8{font-size:21.252427184466pt;}a.acss6bf84{font-size:13.504854368932pt;}a.acss349b0{font-size:10.038834951456pt;}a.acssf23c5{font-size:8pt;}a.acss7e0a8{font-size:9.2233009708738pt;}a.acsse6f77{font-size:16.970873786408pt;}a.acssc51bb{font-size:14.116504854369pt;}a.acss38f57{font-size:11.26213592233pt;}a.acss066f0{font-size:22pt;}a.acss4e811{font-size:17.31067961165pt;}a.acss9cc90{font-size:12.417475728155pt;}a.acss01721{font-size:15.339805825243pt;}a.acsse9f66{font-size:15.543689320388pt;}a.acss72254{font-size:20.708737864078pt;}a.acsseedeb{font-size:20.776699029126pt;}a.acss25b87{font-size:14.320388349515pt;}a.acss7c517{font-size:12.757281553398pt;}a.acss7a3ee{font-size:18.941747572816pt;}a.acssf92d5{font-size:18.26213592233pt;}a.acss551d3{font-size:16.291262135922pt;} .icon-widgets:before {content: "\e1bd";}.icon-search:before {content: "\e8b6";}.icon-shopping-cart:after {content: "\e8cc";}
category

Calculate power of a number using recursion in C language

Calculate power of a number using recursion in C language

In this tutorial, we will discuss the concept of  Calculate power of a given number using recursion in C language

In this post, we will learn how to  find the power of a given number using recursion in C  language

 

Program 1

#include <stdio.h>
#include <stdlib.h>
int find_Power(int num1,int num2);//function prototype
int main()
{
    int base, powerValue, result;

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

    printf("Enter power number: ");
    scanf("%d",&powerValue);

    result=find_Power(base,powerValue);

    printf("%d^%d=%d",base,powerValue,result);
    getch();
    return 0;
}

int find_Power(int base, int powerValue)//
{
    if(powerValue !=0)
        return (base*find_Power(base,powerValue-1));
    else
        return 1;
}

When the above code is executed, it produces the following results

Enter base number: 4
Enter the power number: 5
4^5=1024

Pow() pre-defined function is used to calculate the power of a number raised to a decimal value

 

Similar post

C++ program to find the power of a number using recursion

C program to find the power of a number using recursion

Java program to find the power of a number using recursion

 

Suggested for you

C recursion

C input-output function

C function

C user defined function

Java program to find middle of three number using method
Calculate power of a number using recursion in C++
Karmehavannan

I am Mr S.Karmehavannan. Founder and CEO of this website. This website specially designed for the programming learners and very especially programming beginners, this website will gradually lead the learners to develop their programming skill.

Share
Published by
Karmehavannan

Recent Posts

10 best Ways to Subtract Two Numbers in Java (With Examples)

10 best Ways to Subtract Two Numbers in Java (With Examples) In this article, we…

3 weeks ago

Array Data Structure: Definition, Types, Operations & Advantages

Array Data Structure: Definition, Types, Operations & Advantages Array Data Structure Introduction In this post,…

3 weeks ago

20 ways to subtract two numbers in Java

20 ways to subtract two numbers in Java In this article, we will discuss the…

3 weeks ago

10 simple ways to add two numbers in Java

10 simple ways to add two numbers in Java In this article, we will discuss…

2 months ago

Write a Python program to find the first n prime numbers

Write a Python program to find the first n prime numbers In this article we…

2 months ago

Python: Calculate Average of odd and even in a list using loops

Python: Calculate Average of odd and even in a list using loops In this post,…

3 months ago