递归和迭代的效率比较

#include<stdio.h>
unsigned long fanc(int n)//递归调用
{
	
	if(n<=0)
	{
		return 1;
	}
	else
	{
		return (n*fanc(n-1));
	}
}


unsigned long factorical(int n)//迭代算法
{
	int  result=1;

	while(n>0)
	{
		result*=n;
		n-=1;
	}
	return result;


}
main()
{	
	int n;
	printf("input the num :");
	scanf("%d",&n);
	printf("the sum is %u\n",fanc(n));
	printf("the sum is %lu\n",factorical(n));
}