遞歸5-7
result = factorial(n-1)*n;這句代碼到底是怎么運(yùn)行的,沒看懂,結(jié)果不應(yīng)該啊20嗎?
#include <stdio.h>
int factorial(int n)
{
int result;
if(n<0)
{
printf("輸入錯(cuò)誤!\n");
return 0;?
}
else if(n==0||n==1)
{
result = 1;
}
else
{
result = factorial(n-1)*n;
?}
?return result;
?}
?int main()
?{
? int n = 0;
? printf("%d的階乘=%d",n,factorial(n));
? return 0;
? }?
2017-01-08
遞歸函數(shù)，不斷的調(diào)用函數(shù)來求階乘，很好懂呀