2019-09-28 11:15:22 +08:00
|
|
|
package Maths;
|
2020-05-07 22:00:58 +08:00
|
|
|
import java.util.*; //for importing scanner
|
2019-09-28 11:15:22 +08:00
|
|
|
|
|
|
|
public class Factorial {
|
2020-05-07 22:58:31 +08:00
|
|
|
public static void main(String[] args) { //main method
|
2020-05-08 13:08:05 +08:00
|
|
|
int n = 1;
|
|
|
|
Scanner sc= new Scanner(System.in);
|
|
|
|
System.out.println("Enter Number");
|
|
|
|
n=sc.nextInt();
|
|
|
|
System.out.println(n + "! = " + factorial(n));
|
2019-09-28 11:15:22 +08:00
|
|
|
}
|
|
|
|
|
2019-12-11 12:35:54 +08:00
|
|
|
//Factorial = n! = n1 * (n-1) * (n-2)*...1
|
|
|
|
|
2019-09-28 11:15:22 +08:00
|
|
|
/**
|
2019-12-11 12:35:54 +08:00
|
|
|
* Calculate factorial N
|
2019-09-28 11:15:22 +08:00
|
|
|
*
|
|
|
|
* @param n the number
|
|
|
|
* @return the factorial of {@code n}
|
|
|
|
*/
|
|
|
|
public static long factorial(int n) {
|
2020-03-18 10:05:27 +08:00
|
|
|
// Using recursion
|
|
|
|
try {
|
|
|
|
if (n == 0) {
|
|
|
|
return 1; // if n = 0, return factorial of n;
|
|
|
|
}else {
|
|
|
|
return n*factorial(n-1); // While N is greater than 0, call the function again, passing n-1 (Principle of factoring);
|
|
|
|
}
|
|
|
|
}catch (ArithmeticException e) {
|
|
|
|
System.out.println("Dont work with less than 0");
|
|
|
|
}
|
|
|
|
return n;
|
2019-09-28 11:15:22 +08:00
|
|
|
}
|
|
|
|
}
|