Weeks 6, 7, Assignment 2

Lost a mark in the midterm for not assuming n > 8 in the proof of the question that had to do with Fibonacci numbers, guess I'll have to be more careful when proving (especially by induction). Turns out the proof of the recBinSearch(A, f, l, x) in class was really helpful for problem set 4. Proving program correctness and runtime seems much easier than it was CSC165, I think it's actually easier. Seems like we'll be dealing a lot with floors and ceilings, especially with sorting and searching algorithms (I think). Glad to finally have ps4 and a2 off my neck, an exercise and part of a project due in 207, ps4 and a2 in 236, all in one day, plus two midterms and another assignment within 3 days, seems like school only gets more stressful as the weeks and years pass by. In the meanwhile, I have to go prepare for the tests that seem to never stop coming (thankfully there are only 2 left - I think - for the semester after the ones I have next week). Thats all for now, till my next post, ciao.