用递归和非递归分别求n的阶乘

#include<stdio.h>
#include<stdlib.h>
int Factorial1(int n)///递归
{
	if (n==1)
	{
		return 1;
	}
	else
	{
		return n*Factorial1(n - 1);
	}
}

int Factorial2(int n)//非递归
{
	int i = 0;
	int sum = 1;
	for (i = 1; i <= n; i++)
	{
		sum *= i;
	}
	return sum;
}

int main()
{
	int n = 0;
	printf("请输入一个数字：>\n");
	scanf("%d", &n);
	printf("%d\n", Factorial1(n));
	printf("%d\n", Factorial2(n));
	system("pause");
	return 0;
}