Which of the following would be a recursive case for a summation algorithm (the sum of the numbers from 0 to n)?
A) If n = 0 then summation(n) = 0
B) if n 0 then summation(n) = 5
C) If n 0 then summation(n) = getValue(n)
D) If n 0 then summation(n) = n + summation(n-1)
E) None of these

Question

Which of the following would be a recursive case for a summation algorithm (the sum of the numbers from 0 to n)?
A) If n = 0 then summation(n) = 0
B) if n > 0 then summation(n) = 5
C) If n > 0 then summation(n) = getValue(n)
D) If n > 0 then summation(n) = n + summation(n-1)
E) None of these

Quizplus · Accepted Answer

The recursive case for the summation algorithm would be to add the current number (n) to the sum of the previous numbers (summation(n-1)). Therefore, the correct answer is D: If n > 0 then summation(n) = n + summation(n-1).

Which of the Following Would Be a Recursive Case for a Summation