int factorial(int n) //递归
{
if(n == 1)
{
return 1;
}
else
{
return n*factorial(n-1);// 5*4!到 4*3! 到3*2!.....
}
}
int factorial1(int n)
{
int sum = 1;
for(;n>0;n--)//非递归
{
sum *= n;
}
return sum;
}
int main()
{
int n = 0;
printf("请输入数字n:");
scanf("%d",&n);
factorial(n);
factorial1(n);
printf("%d\n",factorial(n));
printf("%d\n",factorial1(n));
}
递归和非递归分别实现求n的阶乘
最新推荐文章于 2022-11-23 00:00:57 发布