Hmmmm

Last class the professor did a full example of proving that insertion sort is O(n^2). I think it made sense, but I'm starting to get confused about all the formats we have to follow. In the tutorial, the quiz was another proof. I'm worried about the formats of my proof in assignment 2. It's also hard to find new things to talk about because I'm not very good at programming algorithms and we've talked a lot about proofs