Correctness of Code

This week we talked about the correctness of code. I thought that this was interesting in the sense that we are subconsciously using these algorithms to check our of code. In a sense, we are just training our mind to be like a debugger.
I also thought that the assignment was fair. Most of the questions are straightforward (except the ternary tree question). The second question was a challenge as well because I don't feel like I've grasp time complexity well.

It has been a while

I had almost forgotten about slogs for the last couple of weeks (oh no! there goes my slog mark). Anyways, to recap what we've done: closed form for recursive functions, structural induction, merge sort time-complexity and the master-theorem for divide and conquer. I need to look over last week's notes as I found the concepts sort of difficult to understand. Now that most of my midterms are over, I should be able to find time for this (and for catching up on my slog -.-).

Induction... finished

The assignment was due on Monday. At first it appeared intimidating, but as I actually got into the problems, I found out that the problems were easier than my first impression. I had been confused about "the principle of well-ordering" and how it was one of the proof of induction. I originally thought that it was induction itself, but a look into the textbook clarified that it wasn't necessarily induction, but a principle that allows for induction. This is the point of which I know I haven't been paying enough attention in lecture... Anyways... I'll see if I can write up a problem next week.