Recursive Range Sum
sum that accepts a single
Int value and returns the sum
of all the integers in the range 1..value as an
So, for example, given the input 10 you should return 55: 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10.
You can reject arguments less than or equal to 0 and ones greater than 128 by throwing an
You should submit a recursive solution. The range sum of 1 is 1, and this represents the base case. The range sum of n is n + the range sum of n - 1, and this represents the recursive step.