Complete the following code snippet, which is intended to be a recursive method that will find the sum of all elements in an array of double values from index to the end of the array: // return the sum of all elements in arr[]
Public static double findSum(double arr[], int index)
{
If (index == 0)
{
Return arr[index];
}
Else
{
_____________________
}
}
Assume that this method would be called using an existing array named myArray as follows:
FindSum(myArray, myArray.length - 1);
A) return (findSum(arr, index + 1));
B) return (findSum(arr, index - 1));
C) return (arr[index] + findSum(arr, index + 1));
D) return (arr[index] + findSum(arr, index - 1));

Question

Quizplus · Accepted Answer

The method should add the current element at the index to the sum of the remaining elements, which is achieved by calling the function recursively with the previous index (index - 1).

Complete the Following Code Snippet, Which Is Intended to Be