//递归求数的阶乘
#include <stdio.h>
long recursion(int n);
void main()
{
int n;
long result;
scanf("%d",&n);
result=recursion(n);
printf("%d!=%ld\n",n,result);
}
long recursion(int n)
{
long tmp_result;
if(n==0 || n==1)
{
tmp_result=n;
}else if(n<0){
printf("error input");
}
else
{
tmp_result=recursion(n-1)*n;
}
return tmp_result;
}
原文:https://www.cnblogs.com/yanweichen/p/10322275.html