27 lines
506 B
Java
27 lines
506 B
Java
|
// functional/RecursiveFactorial.java
|
|||
|
|
// <20>2016 MindView LLC: see Copyright.txt
|
|||
|
|
// We make no guarantees that this code is fit for any purpose.
|
|||
|
|
// Visit http://mindviewinc.com/Books/OnJava/ for more book information.
|
|||
|
|
|
|||
|
|
public class RecursiveFactorial {
|
|||
|
|
static IntCall fact;
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
fact = n -> n == 0 ? 1 : n * fact.call(n - 1);
|
|||
|
|
for(int i = 0; i <= 10; i++)
|
|||
|
|
System.out.println(fact.call(i));
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
/* Output:
|
|||
|
|
1
|
|||
|
|
1
|
|||
|
|
2
|
|||
|
|
6
|
|||
|
|
24
|
|||
|
|
120
|
|||
|
|
720
|
|||
|
|
5040
|
|||
|
|
40320
|
|||
|
|
362880
|
|||
|
|
3628800
|
|||
|
|
*/
|