Slog for Week 7

For Week 7, the professor Larry Zhang went over more proofs, disproofs, and the new concept, algorithm. For the part of proofs and disproofs, I feel like they are a little more detailed contents from last week, so do not feel very difficult. Also in the Tutorials, we did same problem sets again, so that I feel comfortable with how to find specific number or notation.

For the other part of lecture, the lecture about algorithm, although I have no idea at all when I first heard it, but I suddenly understood what is algorithm by watching the running time visual program, which the professor showed. The fact constant factor do not matter from the running time was surprised even though it is only for the highest-order term matters. 

Except them, we just learned two new notation called asymptotic notation, and how to count the steps in the linear search, which I am really familiar with because of my experience from CSC108.