1. Comments from last time
Pace:
WTS: 0
STS: ~5
JR: ~10
STF: ~10
WTF: ~5 1

2. Comments from last time
Is n ≤ O(n) a shorthand: yes
Is big-O runtime? No, it’s a `class’ of fxns.
Formal steps in proving runtime is ≤ O(f(n)): exhibit a constant c and prove on any input of size n, runtime ≤ O(f(n)): 2

3. Can’t see board from close up: front lights are off, blinds down
Issue w. Room
Mic: working on it
Can’t see board from close up: front lights are off, blinds down
Room too dark: the other `lights’ are sprinklers 
Write bigger, add more text 3

4. MISC 4

5. Comment cards 5