Answers for "factorial recursion java time complexity"

0

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;
    }
}
Posted by: Guest on December-06-2020

Code answers related to "factorial recursion java time complexity"

Code answers related to "Java"

Java Answers by Framework

Browse Popular Code Answers by Language