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

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

1.用递归的方法求解

int jiecheng(int n) {
	if (n == 1) {
		return 1;
	}
	return n*jiecheng(n - 1);//n乘n-1开始递归
}
int main() {
	int ret = jiecheng(4);
	printf("%d", ret);
	system("pause");
	return 0;
}

2.用非递归方式求解

int main() {
	int n = 4;
	int tum = 1;
	for (int i = 1; i <= n; ++i) {//遍历所有的数
		tum = tum*i;进行累积
	}
	printf("%d", tum);
	system("pause");
	return 0;
}

猜你喜欢

转载自blog.csdn.net/a_hang_szz/article/details/88846662