Basic recursive method - factorial

java recursion factorial
bob picture bob · May 10, 2010 · Viewed 31.5k times · Source

I am practicing recursion and I can't see why this method does not seem to work. Any ideas?

    public void fact()
    {
        fact(5);
    }

    public int fact(int n)
    {
        if(n == 1){
            return 1;
        }
        return n * (fact(n-1));
    }
}

Thanks

Answer

Anthony Forloney picture Anthony Forloney · May 10, 2010

Your code seems to work but you are not doing anything with the returned value, put method call fact or fact(5) inside of a System.out.println and see what you get.

Related questions

Finding the factorial using recursion with the BigInteger Class

So consider the following program-segment! I've tried to use the basic recursion function to determine the factorial of a number, but now using the BigInteger class. public static BigInteger fact(int a) { BigInteger factorial = BigInteger.ONE; BigInteger factz = BigInteger.ONE; …

Read More
Java recursive Fibonacci sequence

Please explain this simple code: public int fibonacci(int n) { if(n == 0) return 0; else if(n == 1) return 1; else return fibonacci(n - 1) + fibonacci(n - 2); } I'm confused with the last line especially because if n = 5 for example, then fibonacci(4) + fibonacci(3) …

Read More
Recursively list files in Java

How do I recursively list all files under a directory in Java? Does the framework provide any utility? I saw a lot of hacky implementations. But none from the framework or nio

Read More