Sum 1..n recursively:
- Acheck_circle
if (n == 1) return 1; else return n + sum(n - 1);
- B
for (i = 1...) sum += i;
- C
return n * (n + 1) / 2;
- D
return n;
Explanation
Base case n = 1; recursive call decreases n.
Recursion
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?