Apply C++ to write and test the following power( ) function that returns x raised to the power n , where n can be any integer:
double power(double x, int p);
use the algorithm that would compute x 20 by multiplying 1 by x 20 times
please i need step by step comprehensive c++ solution
Solution
#include <iostream>
using namespace std;
int power(int n1,int n2);
int main()
{
int base, exp;
cout << \"Enter base number: \";
cin >> base;
cout << \"Enter power number(positive integer): \";
cin >> exp;
cout << base << \" ^ \" << exp << \" = \" << power(base, exp);
return 0;
}
int power(int base,int exp)
{
if ( exp!=1 )
return (base*power(base,exp-1));
}
output:
Enter base number: 3
Enter power number(positive integer): 3
3^3 = 27
.
Apply C++ to write and test the following power( ) function that retur.docx
1. Apply C++ to write and test the following power( ) function that returns x raised to the power n ,
where n can be any integer:
double power(double x, int p);
use the algorithm that would compute x 20
by multiplying 1 by x 20
times
please i need step by step comprehensive c++ solution
Solution
#include <iostream>
using namespace std;
int power(int n1,int n2);
int main()
{
int base, exp;
cout << "Enter base number: ";
cin >> base;
cout << "Enter power number(positive integer): ";
cin >> exp;
cout << base << " ^ " << exp << " = " << power(base, exp);
return 0;
}
int power(int base,int exp)
{
if ( exp!=1 )
return (base*power(base,exp-1));
}
output:
Enter base number: 3
Enter power number(positive integer): 3
3^3 = 27
