Python【斐波纳契】3种算法及其复杂度

打印fibonacci前32位，导入time模块进行计时

from time import time
num = 32

1、列表法

start = time()
def fib(n):
    if n < 3:
        return 1
    elif n >= 3:
        ls = [1, 1]
        for i in range(3, n):
            ls.append(sum(ls))
            del ls[0]
        return sum(ls)
print(' '.join(str(fib(i)) for i in range(1, num + 1)))
print(time() - start)

2、递归法

start = time()
def fb(n):
    if n < 3:
        return 1
    elif n >= 3:
        return fb(n - 1) + fb(n - 2)
print(' '.join([str(fb(i)) for i in range(1, num + 1)]))
print(time() - start)

3、迭代器法

start = time()
def fbiter(n):
    ls = [0, 1]
    i = 1
    while i < n:
        yield str(ls[1])
        ls.append(sum(ls))
        del ls[0]
        i += 1
print(' '.join(fbiter(num + 1)))
print(time() - start)

复杂度

-	时间复杂度	空间复杂度
列表法	n	3
递归法	$2^n$	n