Question: Write a recursive method that takes a positive integer n and computes the sum of the first n positive integers. For example, if n is
Write a recursive method that takes a positive integer n and computes the sum of the first n positive integers. For example, if n is 5, the method should return 15, which is the sum of 1 + 2 + 3 + 4 + 5.
Your method should have the following signature:
public static int sum(int n)
Your solution should use recursion.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
