The sum of the elements of an integer -valued array recursively calculated as fo

Question

The sum of the elements of an integer -valued array recursively calculated as follows:

The sum of an array of size 0 is 0;

Otherwise, the sum of the first n elements of an array is the sum of the last of these added to the sum of the previous n-1 elements . Write an int method named sum that accepts an integer array , and the number of elements in the array and returns the sum of the elements of the array .

I have this code:

public int sum (int [] arr, int num){

if (num==0) return 0;

return arr[0]+sum(arr, num-1);

}

but it does not work. Help please!!

Explanation / Answer

it should be return( arr[ num - 1 ] + sum(arr, num-1) ) and not return arr[0]+sum(arr, num-1);

Last element has index of num - 1 and not 0.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.