Recursive Function in Java

A function is said to be recursive, whose definition references itself. In other words- a function, called by its own implementation is Recursive function.

The below given program list the factorial of 1 to 20 and is a good example of Recursive Function in java:

Code

public class RecursiveFunction {

    public static void main(String[] args) {
        System.out.println("Number\t\tFactorial");
        for (int i = 0; i <= 20; i++) {
            System.out.println(i + "\t\t" + Factorial(i));
        }
    }

    public static long Factorial(long x) {
        if (x == 0) {
            return 1;
        } else {
            return Factorial(x - 1) * x;
        }
    }
}

Output

Number                               Factorial

0                                              1
1                                              1
2                                              2
3                                              6
4                                              24
5                                              120
6                                              720
7                                              5040
8                                              40320
9                                              362880
10                                           3628800
11                                           39916800
12                                           479001600
13                                           6227020800
14                                           87178291200
15                                           1307674368000
16                                           20922789888000
17                                           355687428096000
18                                           6402373705728000
19                                           121645100408832000
20                                           2432902008176640000