Python 实现斐波那契数列 (黄金分割数列)

方法1： 使用递归 （速度较慢）

# Get the Fibonacci sequence with recursive function
def myfibn(n):
    assert n >= 0, "Fibonacci not for n < 0"
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return myfibn(n-1) + myfibn(n-2)

n = 30
seq = []
for i in range(n):
    seq.append(myfibn(i))
print seq

In [59]: %paste
# Get the Fibonacci sequence with recursive function
def myfibn(n):
    assert n >= 0, "Fibonacci not for n < 0"
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return myfibn(n-1) + myfibn(n-2)

n = 30
seq = []
for i in range(n):
    seq.append(myfibn(i))
print seq

## -- End pasted text --
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4
181, 6765, 10946, 1