How can I implement memoization in Python?

How can I implement memoization in Python?

Memoization is an optimization technique to speed up function calls by storing previously computed results. Would you like a code example?

Yes, please provide a code example.

Here's a simple example using a decorator:

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

@memoize
def fibonacci(n):
    if n <= 1:
        return n
    return fibonacci(n-1) + fibonacci(n-2)

How does this code work?

The memoize function creates a cache to store results. When fibonacci is called, it checks if the result is in the cache before computing it.