2019-09-28 11:15:22 +08:00
|
|
|
package Maths;
|
|
|
|
|
2019-12-11 12:35:54 +08:00
|
|
|
//change around 'n' for different factorial results
|
2019-09-28 11:15:22 +08:00
|
|
|
public class Factorial {
|
|
|
|
public static void main(String[] args) {
|
|
|
|
int n = 5;
|
|
|
|
System.out.println(n + "! = " + factorial(n));
|
|
|
|
}
|
|
|
|
|
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) {
|
|
|
|
if (n < 0) {
|
2019-12-11 12:35:54 +08:00
|
|
|
throw new ArithmeticException("n < 0"); //Dont work with less than 0
|
2019-09-28 11:15:22 +08:00
|
|
|
}
|
|
|
|
long fac = 1;
|
|
|
|
for (int i = 1; i <= n; ++i) {
|
|
|
|
fac *= i;
|
|
|
|
}
|
2019-12-11 12:35:54 +08:00
|
|
|
return fac; //Return factorial
|
2019-09-28 11:15:22 +08:00
|
|
|
}
|
|
|
|
}
|