-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathevaluate.py
125 lines (97 loc) · 1.88 KB
/
evaluate.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
"""
evaluate.py
Practice problems for on-paper evaluation.
1. 3x Basic Recursion
2. 3x Basic Loops
3. 3x Recursion with Loops
"""
# 1 - Basic Recursion ---------------------------------------------------------
def f1a(n, k):
"""
Evaluate f1a(5, 3)
"""
if n == 0:
return 1
return f1a(n-1, k) * k
def f1b(n, k):
"""
Evaluate f1b(6, 3)
"""
if n == 1:
return 1
return f1b(n-1, k) * k
def f1c(n, k):
"""
Evaluate f1c(7, 3)
"""
if n < 5:
if n == 1:
return 1
return f1c(n-1, k)
return f1c(n-2, k) * k
# 2 - Basic Loops -------------------------------------------------------------
def f2a(n, k):
"""
Evaluate f2a(7, 3)
"""
c = 0
for i in range(k):
c += i
if i > 5:
c += n
return c
def f2b(n, k):
"""
Evaluate f2b(3, 10)
"""
s = ""
for i in range(k):
s += str(n)
if i >= k-1:
s = s.replace("33", "ZP")
return s
def f2c(n, k):
"""
Evaluate f2c(3, 5)
"""
l = [None] * k
i = 0
while i < k:
l[i % 2] = n
l[i % 2 + 1] = 2
i += 1
return l
# 3 - Recursion with Loops ----------------------------------------------------
def f3a(n, k):
"""
Evaluate f3a(5, 3)
"""
for i in range(k):
if n > 3:
return f3a(n-1, k)
return [i] + f3a(n-1, k-1)
return [n]
def f3b(n, k):
"""
Evaluate f3b(3, 2)
"""
if n <= 0:
return []
lst = []
for s in "practice"[0:n]:
new = str(n) + s
lst.append(new)
return lst + f3b(n-1, k)
def f3c(n, k):
"""
Evaluate f3c(5, 2)
"""
if k <= 0:
return "bye."
s = ""
for _ in range(k):
if n % 2 == 1:
s += "hi," + f3c(n-1, k-1)
else:
s += "hey," + f3c(n, k-1)
return s