#include <stdio.h>
// 递归实现
int recursiveFactorial(int n) {
if (n <= 1) {
return 1;
} else {
return n * recursiveFactorial(n - 1);
}
}
// 递推实现
int iterativeFactorial(int n) {
int result = 1;
for (int i = 1; i <= n; ++i) {
result *= i;
}
return result;
}
int main() {
int n = 5;
// 递归调用
int recursiveResult = recursiveFactorial(n);
printf("Recursive Factorial: %d\n", recursiveResult);
// 递推调用
int iterativeResult = iterativeFactorial(n);
printf("Iterative Factorial: %d\n", iterativeResult);
return 0;
}