Lecture 3

Other than Simple Induction, We learnt Complete Induction and Principle of well ordering.
In complete induction for all n which belongs to a natural number, we basically assume all the cases from 0 to n - 1 and then we prove for n using the assumption.
At first I didn’t really understand the principle of well ordering…but after going through the lecture slides and re-reading the Round Robin Domino example…it wasn’t as intimidating as it seemed when I first saw it.
Complete Induction seemed just like an upgrade on simple induction and wasn’t all that hard to grasp.
The Assignment was pretty hard. Honestly we should have started a bit earlier considering this to be our first CSC236 Assignment.