Question

In Java

Write a recursive method called sumUpto(n) which will return the sum of the first n integers. For example, sumUpto(4) will return 10 because 1+2+3+4 = 10. sumUpto(5) will return 15 because 1+2+3+4+5=15. So you can see that sumUpto(5) = sumUpto(4) + 5. Make this more general for n : sumUpto(n) = sumUpto(??) + n Figure out the base case and write the method………..

import java.util.Scanner;
public class Lab12Num1
{
public static int sumUpto(int num)
{
  
}
public static void main(String[] args) {
  
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println("The sum of the numbers is:" + sumUpto(n));
  
}
}

Answer 1

import java.util.Scanner;

public class Lab12Num1 {
    public static int sumUpto(int num) {
        if (num <= 0) {
            return 0;
        } else {
            return num + sumUpto(num - 1);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println("The sum of the numbers is:" + sumUpto(n));
    }
}