斐波纳契数的非递归实现

用迭代求数列的前20位。

C的
int i, a[20];

a[0] = 1;
a[1] = 1;

for(i = 2; i < 20; i++)
a[i] = a[i - 1] + a[i - 2];

vb的

dim i as integer
dim a(1 to 20) as integer

a(1) = 1
a(2) = 1

for i = 3 to 20
a(i) = a(i - 1) + a(i - 2)
next i