斐波那契数列

斐波那契数列

【题目】：

写一个函数，要求输入n，输出斐波那契数列的的第n项。
斐波那契数列定义如下：

【解题思路】：

1. 递归
2. 迭代
3. 通项公式
   实验证明：迭代法要比递归更加高效

# use recursive method
def fib_recursive(n):
    if n <= 0:
        return 0
    if n == 1:
        return 1

    return fib_recursive(n - 1) + fib_recursive(n - 2)


# use the iterative method
def fib_iterative(n):
    if n <= 0:
        return 0
    if n == 1:
        return 1

    first, second = 0, 1

    for i in range(2, n + 1):
        first, second = second, first + second
    return second


# use the function
def fib_use_function(n):
    return int((((1 + 5 ** 0.5) / 2) ** n - ((1 - 5 ** 0.5) / 2) ** n) / 5 ** 0.5)


# test
import time

n = 35
start = time.time()
print("Recursive method:", fib_recursive(n), end=" Time consumption=")
end = time.time()
print(end - start)

start = time.time()
print("Iterative method:", fib_iterative(n), end=" Time consumption=")
end = time.time()
print(end - start)

start = time.time()
print("Function method:", fib_use_function(n), end=" Time consumption=")
end = time.time()
print(end - start)

运行结果：