Recursion

Recursion.java

package Recursion;
import java.util.Scanner;

public class Recursion {
    //Factorial
    public static int fact( int n ){
        System.out.println("factorial of " + n);
        if( n <= 1 ) return 1; //Base Condition
        return n * fact(n-1);
    }
    //Homework
    public static void Qone(int n) {
        System.out.print(n);
        if( n > 1) {
            Qone(n-1);
        }
    }
    public static int Qtwo(int n){
        if( n <= 1 ) return 1; // Base Condition
        return n + Qtwo(n-1);
    }
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.print("Enter a number : ");
        int n = s.nextInt();
        System.out.println("Factorial : " + fact(n));
        Qone(n);
        System.out.println("\n Addition : " + Qtwo(n));
    }
}