SLOG #5

I am beginning to understand the concept of proofs a lot more after completing the assignment. After looking at the assignment solutions, I was able to determine where exactly I went wrong so that I know not to repeat the same mistake on the midterm. However, the current material we are learning regarding worst-case complexity and O notation is confusing to me. In tutorial, we counted each step in a line of code, where as in the lectures, we counted each line as a single step of code. I found this really confusing at first but now that I am aware of the difference, it is slightly more clear. Hopefully reading over the course notes and lecture notes again will clear out some of these confusions. Currently, I am polishing my knowledge of proofs so that I can perform well on this mid-term.