Recursive Summation

In the starter code Summation.java you are provided with the method sumI() that computes the summation of the integers from 1 to n inclusive using iteration. You are to complete the body of the sumR() method so that it also computes the sum of the integers from 1 to n, but you must use recursion.

CODE:

/** * Provides recursive and iterative implementations of summation function. * * @author Dean Hendrix (dh@auburn.edu) * @version 2018-03-23 */ public class Summation {

/** Returns the sum of 1..n for n > 0. */ public static int sumI(int n) { int sum = 1; for (int i = 2; i <= n; i++) { sum = sum + i; } return sum; }

/** Returns the sum of 1..n */ public static int sumR(int n) { return 0; }

/** Drives execution. */ public static void main(String[] args) { for (int i = 1; i < 10; i++) { int s1 = sumI(i); int s2 = sumR(i); System.out.println(i + ": " + s1 + ", " + s2); }

int sum = sumI(5); sum = sumR(5); System.out.println(sum); } }