The following is an example of a base case for a summation algorithm (the sum of the numbers from 0 to n): If n 0 then summation (n) = n + summation (n-1)

Name: The following is an example of a base case for a summation algorithm (the sum of the numbers from 0 to n): If n > 0 then summation (n) = n + summation (n-1)
Brand: Quizplus
Rating: 4.8 (37 reviews)

Question

The following is an example of a base case for a summation algorithm (the sum of the numbers from 0 to n): If n > 0 then summation (n) = n + summation (n-1)

Quizplus · Accepted Answer

The statement describes the recursive case, not the base case. The base case for a summation algorithm would be something like "If n = 0 then summation(n) = 0," which stops the recursion.

The Following Is an Example of a Base Case for a Summation