Fibonacci recursive

rowankim400 22.05.2026 11:47

Fibonacci recursive

views.py

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

print(bubble_sort([5, 3, 8, 1, 2]))

core.py

def memoize(fn):
    cache = {}
    def wrapper(*args):
        if args not in cache:
            cache[args] = fn(*args)
        return cache[args]
    return wrapper

@memoize
def expensive(n):
    return sum(range(n))

print(expensive(1000000))

main.py

def hello():
    print("Hello, World!")

Fibonacci recursive

Are you sure you want to delete this post?