Chapter 14.3, Problem 15STE

Explanation of Solution

Recursive function definition for “squares” function:

The recursive function definition for “squares” function is shown below:

//Function definition for "squares" function

int squares(int n)

{

      /* If "n" is less than or equal to "1" */

      if (n <= 1)

            //Returns "1"

            return 1;

      //Otherwise

      else

     /* Recursively call the "squares" function with subtracting the value of "n" by "1" and then add and multiplied by "n" */

            return (squares(n-1) + n * n);

}

Explanation:

The above function is used to compute the sum of the squares of numbers from “1” to “n”.

• In this function, first check the value of “n”. If the value of “n” is less than or equal to “1”, then returns “1”.
• Otherwise, recursively call the “squares” function with subtracting the value of “n” by “1” and then add and multiplied by “n”...