Fibonacci加法器-计算Fibonacci序列中的数字

def fibonacci_recursive(n):
    if n <= 1:
        return n
    else:
        return fibonacci_recursive(n-1) + fibonacci_recursive(n-2)

def fibonacci_iterative(n):
    a, b = 0, 1
    for _ in range(n):
        a, b = b, a + b
    return a

import numpy as np

def matrix_power(matrix, n):
    result = np.identity(len(matrix), dtype=int)
    while n > 0:
        if n % 2 == 1:
            result = np.dot(result, matrix)
        matrix = np.dot(matrix, matrix)
        n //= 2
    return result

def fibonacci_matrix(n):
    if n == 0:
        return 0
    F = np.array([[1, 1], [1, 0]], dtype=int)
    return (matrix_power(F, n - 1)[0, 0])

def fibonacci_memoization(n, memo={}):
    if n in memo:
        return memo[n]
    if n <= 1:
        return n
    memo[n] = fibonacci_memoization(n-1, memo) + fibonacci_memoization(n-2, memo)
    return memo[n]