Complete the code for the recursive method printSum shown in this code snippet, which is intended to return the sum of digits from 1 to n:
A)return (n + printSum(n - 1));
B)return (n - printSum(n - 1));
C)return (n + printSum(n + 1));
D)return (printSum(n - 1));

Question

Complete the code for the recursive method printSum shown in this code snippet, which is intended to return the sum of digits from 1 to n:  
A)return (n + printSum(n - 1)); 
B)return (n - printSum(n - 1)); 
C)return (n + printSum(n + 1)); 
D)return (printSum(n - 1));

Quizplus · Accepted Answer

The recursive call in the method should decrement n by 1 and add it to the sum of digits from 1 to n-1, which is exactly what choice A does. Choice B subtracts the recursive call from n, which is the opposite of what we want. Choice C increments n in the recursive call, which would lead to an infinite loop. Choice D only makes a recursive call without including the current value of n in the sum.

Complete the Code for the Recursive Method PrintSum Shown in This