C++中递归与迭代阶乘的比较

unsigned long long factorial_recursive(int n) {
    if (n == 0 || n == 1) return 1;
    return n * factorial_recursive(n - 1);
}

unsigned long long factorial_iterative(int n) {
    unsigned long long result = 1;
    for (int i = 2; i <= n; ++i) {
        result *= i;
    }
    return result;
}

#include <iostream>

unsigned long long factorial_recursive(int n) {
    if (n == 0 || n == 1) return 1;
    return n * factorial_recursive(n - 1);
}

int main() {
    int n = 5;
    std::cout << "Factorial of "<< n << " (recursive) is: " << factorial_recursive(n) << std::endl;
    return 0;
}

#include <iostream>

unsigned long long factorial_iterative(int n) {
    unsigned long long result = 1;
    for (int i = 2; i <= n; ++i) {
        result *= i;
    }
    return result;
}

int main() {
    int n = 5;
    std::cout << "Factorial of "<< n << " (iterative) is: " << factorial_iterative(n) << std::endl;
    return 0;
}