WEEK 8

With midterm week over, I was able to catch up on my sleep and actually stayed up during my lecture. This week, we covered the amount of time / number of steps taken for linear search and insertion sort, and the worst case scenarios of insertion sort - both upper and lower bound. Counting the number of steps for linear search was simple. When it came to looking at the upper and lower bound of insertion sort, things became much more confusing. However, as we went through it, the steps of proving each bound made sense. I realized that all of the steps would require creative and logical thinking, which I lack. Overall, the material was reasonable but I will need to look at it quite often.

In addition to this week's lecture, I have been working on the assignment. This assignment was a bit more challenging than the first, but it provided me with a lot of practice with proofs. Some of the claims, particularly Claim 1.2 and 1.3, were difficult to prove. These claims involved the formal definition of a limit. I'm not in MAT137 so I'm not that familiar with it. However, with the help of Prof. Heap and Prof. Zhang, I was able to prove each claim - at least I think I did. Hopefully I will do well on this assignment.