October!

It is October already, that was fast!

We continued on with induction for the Fibonacci numbers, where we shrunk the base cases from 2 to 1 (we really just need n=0 to make the prove work).

Then we moved onto Python recursion program, zero-pair binary strings, which looked extremely similar to the link I've found from the last post, we did some algorithm analysis in which we learned back in CSC236.

We also take a quick look at recursion functions that are not very well-defined, in fact, the third function surprises me a lot - it was quite hard to grasp the concept right after the lecture, but after working out the algebra I felt a bit relieved to see that it actually can work.

Off-topic tidbit: We actually went through the overheating "time-out" of the projector (that happened since last week) and got it working again. I really wonder what's going on with the projector (why didn't it happen before?) and why the maintenance people did not fix it yet. Also, somehow the lecture room (compared to my other lecture classes) is quite... humid, is it because of the small room and huge amount of people? That I will never know...