遞迴和非遞迴分別實現求n的階乘
阿新 • • 發佈:2020-12-21
用遞迴和非遞迴分別實現求n的階乘(不考慮溢位的問題)
#include <stdio.h>
int factorial1(int n)
{
int total = 1;
for (int i = 1; i <= n; i++)
{
total *= i;
}
return total;
}
int factorial2(int n)
{
if (n <= 1)
return 1;
else
return n*factorial2(n - 1);
}
int main()
{
printf("%d\n" , factorial1(3));
printf("%d\n", factorial2(4));
return 0;
}
執行結果: