-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpython_charles.txt
82 lines (55 loc) · 1.15 KB
/
python_charles.txt
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
declarative vs imperative knowledge
int, float, string, set, tuple, list, dictionary, class, object, function, function invocation, function return, combined type, expression
+ - * / // ** ( ) != == += -= *= /= //= **= & | ^ ~ << >> &= |= ^= ~= <<= >>= . * ** [ ] [ : ] [ : : ] [i][j][k] __ ; : , = @
assert, global, nonlocal, pass, del
break, continue, is, is not, in, not in
True, False, lambda, yield, from x import y as z
try:
except:
finally:
else:
def main():
pass
if __name__ == "__main__": main()
def function(args):
body
return
for x in range(start, stop, step):
for x in a:
for y in b:
for x in a:
for y in x:
while(bool):
while(bool):
def recursive_funcion(arg_1, arg_2):
base case 1:
return
base case 2:
base case 3:
base case x:
body
recursive call
iteration, recursion
abstraction, decomposition
if
if
if
elif
elif
else
elif
elif
else
elif
elif
else
match(object):
case x:
case y:
case z:
class Fraction(object):
def __init__(self, numerator, denominator):
pass
Requirements Analysis
Algorithmic Complexity
Standard Library