Faktorial Recursif

Source Code

import java.util.Scanner;

public class recursif

{

public static long factorial1(int i)

{

if (i==1) return 1;

else return i*factorial1(i-1);

}

public static long factorial2(int h)

{

if (h==1) return 1;

else return h*factorial2(h-1);

}

 

 

 

public static void main(String[] args)

{

Scanner MyScanner = new Scanner(System.in);

System.out.print(“masukkan angka faktorial ke1=”);

int i = MyScanner.nextInt();

 

System.out.println(“hasil factorial1=”+factorial1(i));

System.out.println(“”);

System.out.print(“————–“);

System.out.println(“”);

System.out.println(“”);

System.out.print(“masukkan angka factorial2=”);

int h = MyScanner.nextInt();

System.out.println(“hasil factorial1=”+factorial2(h));

System.out.println(“”);

System.out.println(“————-“);

System.out.println(“”);

long penjumlah=factorial1(i)+factorial2(h);

System.out.println(“jumlah 2 faktorial=”+penjumlah);

System.out.println(“”);

System.out.println(“————–“);

System.out.println(“”);

long pengurangan=factorial1(i)-factorial2(h);

System.out.println(“pengurangan 2 faktorial=”+pengurangan);

System.out.println(“”);

System.out.println(“—————“);

System.out.println(“”);

long perkalian=factorial1(i)*factorial2(h);

System.out.println(“perkalian 2 faktorial=”+perkalian);

System.out.println(“”);

}

}

Output