SLOG #5

This week we finished up chapter 3, and there were a couple things we went over. We further discussed proof of limits, which was certainly lots of help, considering the problems I had with the material prior to this week. There was also proof by cases which was somewhat new, and the example we did wasn't all that hard to grasp, so no problems there. The last thing for this chapter was disproving, which other than the approach, had nothing too hard or difficult. So ending for this chapter wasn't too bad, and other than a few rules of inference to review, everything looks good. Towards the end of the week, we began to chapter 4 and got introduced to some new material. As of now, it is clear that this chapter will focus on running-times for various programs, how we can measure them, and maybe learning steps to increase their efficiency. The introductory stuff looks pretty easy, and even though it is bound to get harder, i'm very much looking forward to this chapter.