java calculate factorial with recursion code example

Example 1: recursion factorial java

public class Factorial {

    public static void main(String[] args) {
        int num = 6;
        long factorial = multiplyNumbers(num);
        System.out.println("Factorial of " + num + " = " + factorial);
    }
    public static long multiplyNumbers(int num)
    {
        if (num >= 1)
            return num * multiplyNumbers(num - 1);
        else
            return 1;
    }
}

Example 2: factorial calculator without recursion java

public class Tester {
   static int factorial(int n) {
      if (n == 0)
         return 1;
      else
         return (n * factorial(n - 1));
   }
   public static void main(String args[]) {
      int i, fact = 1;
      int number = 5;
      fact = factorial(number);
      System.out.println(number + "! = " + fact);
   }
}