This week during lecture when Danny Heap was discussing the fact that we sometimes imply that some functions work, even though there isn't a way to actually program them, really helped me to fully understand the fact that within some forms of programming, we sometimes need to just think that something may work even though it may not be implemented.

Last week during lectures we learned about combining big-oh notations with one another. I found this to be a little bit confusing until I realized that the way you set it up was somewhat recursive. Once I looked at the equation like that I was able to find out that the big-notations aren't that bad.

This week of class was much more mellow than normal due to the fact that we had a midterm coming up on Friday(today). But it was also because unlike most profs Danny Heap was extremely kind on Wednesday when he knew the majority of people would be writing the CSC148 midterm that day. So instead of normal class, he gave us an exercise to do for the whole time. Which was an extremely generous and kind thing for him to do. Also the midterm today I found was easier than expected due to my hard work and ability to study a lot for it.

This week assignment number 2 was due this week and I feel as though it went well. This was due to the fact that me and my partner utilized the T.A. hours and were able to collaborate and work together to solve each of the proofs in a manageable and proper order. But I hope that we did as well as I feel.

During this week of class we began learning the runtime of the computers and roughly how long the computers take to run certain code. I found this very intriguing to be able to look inside the computer and see just how the computer processes the information and really how long it takes to do it. I'm also very excited to learn more about how the computer does harder tasks such as recursion or certain algorithms like sorting algorithms and running through binary trees and such.