Answer:
p(x,n)
1. if(n==0) [if power is 0]
2. then result =1.
3.else
4. { result=1.
5. for i=1 to n.
6. { result = result * x. } [each time we multiply x once]
7. return result.
8. }
Let's count p(3,3)
3
0, so come to else part.
i=1: result = result *3 = 3
i=2: result = result *3 = 9
i=2: result = result *3 = 27
Explanation:
here the for loop at step 4 takes O(n) time and other steps take constant time. So overall time complexity = O(n)
Answer:
Check the explanation
Explanation:
#include <iostream>
#include <iomanip>
using namespace std;
int getIQ(); // return the score
void printEvaluation(int);
int main()
{
int IQ = 0;
IQ = getIQ();
printEvaluation(IQ);
return 0;
}
int getIQ()
{
int score = 0;
cout << "Please enter your IQ Score to receive your IQ Rating:\n";
cin >> score;
return score;
}
void printEvaluation(int aScore)
{
cout << "IQ Score: " << aScore << " IQ Rating: ";
if (aScore <= 100)
{
cout << "Below Average\n";
}
else if (aScore <= 119)
{
cout <<"Average\n";
}
else if (aScore <= 160)
{
cout << "Superior\n";
}
else if (aScore >= 160 )
{
cout << "Genius\n";
}
}
Answer:
I believe it's accessibility
Explanation:
Because it makes the most sense
