Fibonacci数列
1.定义:
0, 1, 1, 2, 3, 5, 8, 13, 21, . . .;
f0 = 0, f1 = 1, fn= fn−1 + fn−2 for n ≥ 2.
2.两种实现算法:2.1递归(recursive)
Fibonacci数列
1.定义:
0, 1, 1, 2, 3, 5, 8, 13, 21, . . .;
f0 = 0, f1 = 1, fn= fn−1 + fn−2 for n ≥ 2.
2.两种实现算法:2.1递归(recursive)