递归计算阶乘 n!
1 #include <stdio.h>
2
3 //递归求解 n!
4 int recursion_n(int n)
5 {
6 if(n==1)
7 return 1;
8
9 else
10 return n*recursion_n(n-1);
11 }
12
13
14 int main(void)
15 {
16 int recursion_num;
17
18 printf("please input the recursion num:");
19 scanf("%d",&recursion_num);
20
21 printf("result is :%d\n",recursion_n(recursion_num));
22
23 return 0;
24 }
2
3 //递归求解 n!
4 int recursion_n(int n)
5 {
6 if(n==1)
7 return 1;
8
9 else
10 return n*recursion_n(n-1);
11 }
12
13
14 int main(void)
15 {
16 int recursion_num;
17
18 printf("please input the recursion num:");
19 scanf("%d",&recursion_num);
20
21 printf("result is :%d\n",recursion_n(recursion_num));
22
23 return 0;
24 }