递归和非递归求n的阶乘

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>

int fun1(int n) {
	if (n < 2) {
		return 1;
	}
	return n*fun1(n - 1);
}
int fun2(int n) {
	int i = 1;
	int ret = 1;
	for (; i <= n; i++) {
		ret *= i;
	}
	return ret;
}

int main() {
	int n = 0;
	scanf("%d", &n);
	printf("%d\n", fun1(n));
	printf("%d\n", fun2(n));


	system("pause");
	return 0;
}

5
120
120
请按任意键继续. . .