Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,940 questions

51,877 answers

573 users

How to calculate the power of a number using recursion in C

2 Answers

0 votes
#include <stdio.h> 
   
int power(int n, int exponent);
     
int main(void) 
{ 
    int exponent = 4, n = 2;
   
    int total = power(n, exponent);
       
    printf("%d ^ %d = %d", n ,exponent, total);
        
    return 0;
}
   
int power(int n, int exponent) {
    if (exponent != 0)
        return n * power(n, exponent - 1);
    else
        return 1;
}
    
    
    
/*
run:
      
2 ^ 4 = 16
   
*/

 



answered May 20, 2017 by avibootz
edited Jan 27, 2024 by avibootz
0 votes
#include <stdio.h>
   
long power_recursion(int n, int power) {
    if (power) {
        return n * power_recursion(n, power - 1);
    }
    
    return 1;
}
    
int main()
{
    int n = 5 , power = 3;
   
    printf("%d ^ %d = %d", n ,power, power_recursion(n, power));
    
    return 0;
}
    
    
    
    
/*
run:
    
5 ^ 3 = 125
    
*/

 



answered Jan 27, 2024 by avibootz

Related questions

1 answer 160 views
1 answer 128 views
1 answer 184 views
1 answer 177 views
1 answer 160 views
...