Question

The sum of the numbers from 1 to n can be performed recursively as follows: The sum from 1 to 1 is 1. The sum from 1 to n is n more than the sum from 1 to n-1. Write a int-function named sum that accepts an int parameter, n, and recursively calculates and returns the sum of the numbers from 1 to n. .

Answer 1

Answer:

S(1) = 1

S(n) = S(n-1) + n

Where S(n) is the sum from 1 till n

And,

S(n-1) is the sum from 1 till n-1