Week 4

Assignment 1 was due. I found it difficult without help from TAs and the instructor. Question 2 was the one I had trouble figuring out the algorithm for it. Question 1 I thought I understood, and probably got the best marks for. Question 3 was also confusing, I couldn't understand the whole n1-n2 and why we continue this sequence. At the end, I guess I got it. In class, we talked about Recursion, Fibonnaci sequence, and unwinding. I have to admit, I did not understand unwinding at first, but after some help from friends and TAs, I got it. Also, since this is the only course this term where we still see Python, the recursion algorithms that we saw reminded me of CSC148.