e5ad1f2ef0
Adding try/catch and recursion to optimize the code
32 lines
800 B
Java
32 lines
800 B
Java
package Maths;
|
|
|
|
//change around 'n' for different factorial results
|
|
public class Factorial {
|
|
public static void main(String[] args) {
|
|
int n = 5;
|
|
System.out.println(n + "! = " + factorial(n));
|
|
}
|
|
|
|
//Factorial = n! = n1 * (n-1) * (n-2)*...1
|
|
|
|
/**
|
|
* Calculate factorial N
|
|
*
|
|
* @param n the number
|
|
* @return the factorial of {@code n}
|
|
*/
|
|
public static long factorial(int n) {
|
|
// 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;
|
|
}
|
|
}
|