编辑代码

#include <stdio.h>

int recursiveFibonacci(int n) {
    if (n <= 1) {
        return n;
    }
    return recursiveFibonacci(n - 1) + recursiveFibonacci(n - 2);
}


int iterativeFibonacci(int n) {
    if (n <= 1) {
        return n;
    }
    int a = 0, b = 1;
    int result = 0;
    for (int i = 2; i <= n; i++) {
        result = a + b;
        a = b;
        b = result;
    }
    return result;
}

int main() {
    int n = 10; // Calculate the 10th Fibonacci number
    int resultRecursive = recursiveFibonacci(n);
    printf("递归方法：第%d个斐波那契数是%d\n", n, resultRecursive);
    return 0;
}