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,939 questions

51,876 answers

573 users

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

1 Answer

0 votes
#include <iostream>

int power(int n, int exponent);

int main(void)
{
	int exponent = 4, n = 2;

	int total = power(n, exponent);

	std::cout << n << " ^ " << exponent << " = " << total << std::endl;

	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 Jun 11, 2017 by avibootz

Related questions

1 answer 160 views
2 answers 192 views
1 answer 184 views
1 answer 177 views
1 answer 160 views
...