Week 6

I did not attend lecture this week due to the damned A1 for CSC207 so my comments will be solely based on Prof Heap's evening lecture notes. 

Time complexity: We did this a bit last year in 165 (i think) and 148 so this is not new. However, applying the unwrapping principle to time complexities is a nice summation of some of the things we learned so far. I found it interesting how we were allowed to essentially ignore a majority of cases and do the proof for the cases we can, then come back to the other ones later. This strategy seems like it will become quite useful over time. (Since I am writing this retrospectively I know how handy it comes in for A2). The proof however, was very standard, maybe even obvious, after that.