42 lines
913 B
Python
42 lines
913 B
Python
from timing import timing
|
|
|
|
# Naive rekursive Funktion (ohne Decorator oben drüber, um rekursiven Spam zu vermeiden)
|
|
def ways(n):
|
|
if n <= 1:
|
|
return 1
|
|
return ways(n - 1) + ways(n - 2)
|
|
|
|
|
|
# Memoization-Variante mit Dictionary-Cache
|
|
def ways_memoized(n, cache=None):
|
|
if cache is None:
|
|
cache = {}
|
|
if n in cache:
|
|
return cache[n]
|
|
if n <= 1:
|
|
return 1
|
|
|
|
cache[n] = ways_memoized(n - 1, cache) + ways_memoized(n - 2, cache)
|
|
return cache[n]
|
|
|
|
|
|
# Alternativ: Mit functools.lru_cache (Python-Standardweg)
|
|
from functools import lru_cache
|
|
|
|
|
|
@lru_cache(maxsize=None)
|
|
def ways_fast(n):
|
|
if n <= 1:
|
|
return 1
|
|
return ways_fast(n - 1) + ways_fast(n - 2)
|
|
|
|
|
|
# Laufzeitmessung (wie im Hinweis über den äußeren Aufruf)
|
|
print("--- Naive Variante ---")
|
|
timing(ways)(35)
|
|
|
|
print("\n--- Manuelle Memoization ---")
|
|
timing(ways_memoized)(35)
|
|
|
|
print("\n--- Mit functools.lru_cache ---")
|
|
timing(ways_fast)(35) |