用数组和递归的方式分别实现计算斐波那契数列的第20项

1.数组

#include <stdio.h>

int fibonacciArray(int n) {
    int fib[n + 1];
    int i;

    fib[0] = 0;
    fib[1] = 1;

    for (i = 2; i <= n; i++) {
        fib[i] = fib[i - 1] + fib[i - 2];
    }

    return fib[n];
}

int main() {
    int n = 20;
    int result = fibonacciArray(n);

    printf("Fibonacci number at position %d: %d\n", n, result);

    return 0;
}
 

2递归

#include <stdio.h>

int fibonacciRecursive(int n) {
    if (n <= 1) {
        return n;
    }

    return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2);
}

int main() {
    int n = 20;
    int result = fibonacciRecursive(n);

    printf("Fibonacci number at position %d: %d\n", n, result);

    return 0;
}