Question: Give a recursive algorithm for finding the sum of the first n positive integers.
procedure sum(n: nonnegative integers)
if n = 0 then sum(n):=1
else sum(n) := sum(??)
I am not sure how to find the sum of the previous integer and add it to the next. Any help is greatly appreciated!