double pow(double x, int n); Precondition: If x is zero, then n must be positive

Question

double pow(double x, int n);
Precondition: If x is zero, then n must be positive.
Postcondition: The value returned is x raised to the power n.

for this one i HAVE to use this formula --> x^2n = x^n x^n

4. Repeated and Indented Sentences

Write a function that produces output like thefollowing:

This was written by calling number 1.
This was written by calling number 2.
    This was written by calling number 3.
      This was written by calling number4.
      This was ALSO written by callingnumber 4.
    This was ALSO written by calling number 3.
This was ALSO written by calling number 2.
This was ALSO written by calling number 1.

In the above example, the recursion stopped when it reached fourlevels deep, but your function should be capable of continuing anyspecific level with the following function prototype.

void indented_sentences(size_t m, size_t n);
precondition: m <=n;
postcondition: print out the above pattern by calling number from mto n

PLEASE HELP! i need to know this for an upcoming exam!

Explanation / Answer

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.