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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
# Programming Club
Episodes:
* [s1-e1](https://youtu.be/oFArZXJ65RI)
# What is programming?
We write code to talk to our computers.
We tell the computer what to do.
1. write code in a language
2. compile that code into a language that the computer understands
3. give that program to the computer to run.
Topics
* variables
* statements/expressions
* looping
"mo"
-------
| A |
-------
| 2 |
-------
| 3 |
-------
| 4 |
-------
array
['A', '2', '3', '4']
Datatypes
* numbers (int, float)
* char -> character [A-Za-z]
* array -> deck of (similar stuff card, number, char)
* Loop
* 1 -> 2
* chore weekly basis:
wash:
1. collect the dirty clothes
2. separate the whites from the colours
3. load the colours into the washing machine
4. add detergent to the washing machine.
5. close the washing machine door/lid
6. start the washing machine
wash clothes week
* week 1: wash
* week 2: wash
* week 3: wash
* week .: wash
* week .: wash
* week .: wash
* week n: wash
rinse and repeat
* `for` loop
* `while` loop
* condition: passing the lie detector test
* (1 == 1) -> true
* (0 == 1) -> false
```c
for (int i = 0; i < 1000000; i = i + 1) {
printf("%d\n", i);
}
```
```c
while (1 == 1) {
printf("true\n");
}
```
# conditions and logic
# polygraphs
* lie detector
question:
Q: Are you 36 years old?
A: no
* FAIL: this is not the truth
* the exam is over
Q: Are you a male?
A: yes
* PASS: this is the truth
* continue to ask the next question
* true | false
* yes | no
Truth tables
* true: 1
* false: 0
AND
| - | - | ------ |
| x | y | result |
| - | - | ------ |
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
OR
| - | - | ------ |
| x | y | result |
| - | - | ------ |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
* functions: behaviour
* structs: data
code + data = programming
allocation a variable -> stack
* pass by value
x -> clone -> x1
(x1)
\x1\
\x1\
\x1\
(x1 * 2)
-
* pass by reference
`*x`
(x)
\x\
\x\
\ \
( )
-
Workbench
* text editor (vscode, emacs, vim, nano, textmate)
* compiler toolchain
* GNU: gcc
* LLVM: clang
* terminal:
* variable declaration
* assignment
* conditional expression
* loops
* functions
* structs / data
# Version Control
- Version (1 - many)
- Control -> navigate -> time travel -> history
# Recursion
The Fibonacci numbers are the numbers in the following integer sequence.
|0|1|2|3|4|5|6| 7| 8| 9|10|11| 12|
---------------
|0|1|1|2|3|5|8|13|21|34|55|89|144| ...
12th number
n = 12
n - 1 = 11
n - 2 = 11
n0 = 0
n1 = 1
n = (n-1) + (n-2)
144 = 89 + 55
```plaintext
Fn = Fn-1 + Fn-2
F0 = 0 and F1 = 1
```
How to solve a problem?
1. Understand the problem
2. Pick a solution
3. Implement
4. Review
Test Driven Development/Design
1. Red -> failing testing
2. Green -> make it pass, be responsible
3. Refactor -> reflect. can we improve this?
* time/space complexity
* program design
Problem:
Given a number n, print n-th Fibonacci Number.
|
