非递归算法求解Fibonacci数列：C语言实现及前10、20、30、40、50项验证

#include <stdio.h>

int fibonacci(int n) { int a = 0, b = 1, c, i;

if (n == 0)
    return a;

for (i = 2; i <= n; i++) {
    c = a + b;
    a = b;
    b = c;
}

return b;

}

int main() { int n;

printf('Fibonacci Sequence:\n');
for (n = 10; n <= 50; n += 10) {
    printf('Fibonacci(%d) = %d\n', n, fibonacci(n));
}

return 0;

}