Sum of array recursively:
- Acheck_circle
sum(arr, n) = if (n == 0) return 0; else return arr[n-1] + sum(arr, n-1);
- B
Cannot recurse on arrays
- C
Sort first
- D
for-each only
Explanation
Base case empty (n=0); add arr[n-1] to sum of first n-1.
AP Computer Science A· difficulty 4/5
Sum of array recursively:
sum(arr, n) = if (n == 0) return 0; else return arr[n-1] + sum(arr, n-1);
Cannot recurse on arrays
Sort first
for-each only
Explanation
Base case empty (n=0); add arr[n-1] to sum of first n-1.
Want 10 more like this — adaptive to your weak spots?