public class TestRecursion {
public static void main(String[] args) {
long d1 = System.currentTimeMillis();
System.out.printf("%d阶乘的结果：%s%n",10,factoria(10));
long d2 = System.currentTimeMillis();
System.out.printf("递归费时：%s%n",d2 - d1);
System.out.printf("普通循环%d阶乘的结果：%s%n",10,factorialLoop(10));
}
/**
* 求阶乘的方法
*/
static long factoria(int n){
if (n == 1){ //递归头
return 1;
}else{ //递归体
return n * factoria(n -1); // n! = n * (n - 1)!
}
}