Question

Given a real number x and a positive integer k, determine the number of multiplications used to find x^(2^i) starting with x and successively squaring ( to find x^2, x^4 and so on). Is this a more efficient way to find x^(2^i) than by multiplying x by itself the appropriate number of times?
Give the C++ code to work this problem, if possible with recursion, if not explain why?

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

#include <iostream>
using namespace std;
double calculate(double x,int k)
{
if(k==0)
return x;
return calculate(x*x,k-1);
}
int main()
{

cout<<"Enter x: ";
double x;
int k;
cin>>x;
cout<<"Enter k: ";
cin>>k;
cout<<"x^2^k is "<<calculate(x,k)<<endl;
return 0;

}

Kindly revert for any queries

Thanks.