WEEK #4

The first lecture of week 4 was about proving recursive functions which was accompanied by a proof of the Fibonacci Sequence. This was interesting because the Fibonacci sequence had appeared in so many courses before (and I'm guessing there is more to come) yet a formal proof was never given. In the second lecture of the week we talked more about recursive functions as well as their time complexities. We also started looking at the Recursive Binary Search function and analyzed its time complexity. I think that the approximate time complexity for the recBinSearch(x,A,b,e) is :
T(n) = (e-b)*4 + T(1)

WEEK #3

We started the week with the round-robin problem which was confusing for me during the lecture and I think I still do not fully get it, probably because I haven't taken the time to look over it again. When it's actually proven it makes sense and might look easy but it is quite the opposite when you start from scratch, which is probably the case for many other problems as well. It was also interesting to see how one principle linked to another, where PWO => PSI => PCI => PWO. It was nice to see some problems similar to those in 165 when doing "Bases larger than zero". Problem set #2 was straight-forward with a similar structure to that of problem set #1 with the first part like a problem done in lectures and the second part being a follow-up of the first yet without resemblance to lecture problems.