递归和非递归分别实现求n的阶乘

递归实现n的阶乘：

#include<stdlib.h>
#include<stdio.h>
int Factorial(int a) {
	if (a == 1) {
		return 1;
	}
	return a * Factorial(a - 1);
}
int main() {
	int a = 10;
	printf("%d\n", Factorial(a));
	system("pause");
	return 0;
}

10的阶乘 运行结果：非递归实现N的阶乘：

#include<stdio.h>
#include<stdlib.h>
int main() {
	int a = 10;
	int i = 1;
	int Factorial=1;
	int tmp;
	for (; i < 11; i++) {
		tmp = Factorial;
		Factorial = i * tmp;
	}
	printf("%d\n", Factorial);
	system("pause");
	return 0;
}

10的阶乘运行结果：