编辑代码

#include <stdio.h>

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; 
    int resultIterative = iterativeFibonacci(n);
    printf("递推方法：第%d个斐波那契数是%d\n", n, resultIterative);
    return 0;
}