new
This commit is contained in:
1 parent
571cddedba
commit
1934fdfc63
8 files changed
+134
-46
No files matched your search
@@ -0,0 +1,37 @@
|
||||
#Warum rechnet ways(n) richtig?
|
||||
#Der erste Schritt ist entweder 1 Stufe oder 2 Stufen
|
||||
# Zusammen sind das ways(n-1) + ways(n-2)
|
||||
|
||||
#Warum ist es ab n >= 40 langsam?
|
||||
#wird millionenfach doppelt berechnet.exponentielle Laufzeit O(2^n)
|
||||
|
||||
from Pr_5.ha.timing import timing
|
||||
|
||||
# Reeeborg-Funktion
|
||||
def ways(n):
|
||||
if n <= 2:
|
||||
return n
|
||||
return ways(n - 1) + ways(n - 2)
|
||||
|
||||
|
||||
# Laufzeit messen
|
||||
print("Ohne Memoization:")
|
||||
for n in [30, 35, 37]:
|
||||
timing(ways)(n)
|
||||
|
||||
|
||||
# MIT Memoization
|
||||
memo = {}
|
||||
|
||||
def ways_memo(n):
|
||||
if n <= 2:
|
||||
return n
|
||||
if n not in memo:
|
||||
memo[n] = ways_memo(n - 1) + ways_memo(n - 2)
|
||||
return memo[n]
|
||||
|
||||
|
||||
# 4. Laufzeit messen
|
||||
print("Mit Memoization:")
|
||||
for n in [30, 35, 37, 100]:
|
||||
timing(ways_memo)(n)
|
||||
Reference in new issue
Block a user