Worst Case Proofs for Bounding a Sort

    This week's classes have been primarily focused on bounding worst case scenarios of a sort function. The concept of this comes quite easily to me, however the initial stages of upper and lower bound proofs have only proven my need for practice with these sorts of problems (no pun intended). This being said, after visiting Prof. Heap's rather busy office hours, my understanding of how the initial expressions seen in each proof relate to the code we were shown (slide "bounding a sort") was greatly strengthened. From the aforementioned step onward, the proofs make quite a lot of sense and are exceptionally easy for me. I believe I simply need to review my notes once more in order to grasp this fully. I am also reading other student's SLOG's but I have yet to find one that seems to express similar feelings as mine toward this concept or help to assist my learning. It seems that many student's SLOG's are incomplete.

    The tutorial this week was also enjoyable and my quiz went exceptionally well (I think). I feel quite rewarded by my studying to make up for my beyond poor performance on last week's quiz. I must say, however, that the tutorial this week was almost identical to last week's. Not that this is a bad thing, I certainly needed the review, but I feel that I could definitely benefit from a tutorial on bounding a sort. Perhaps this is next week's tutorial topic.

    I have also completed Assignment #2, correcting some of my mistakes that I made last week on which to prove or disprove. The epsilon delta style proofs of the floor functions were honestly the high point of my week (academically), much fun was had with these and I may post more details on my proof style once past the due date.