samedi 9 novembre 2013

Midterms and Complexity

It's hard to believe another Midterm is already upon us, and I have made it my goal to very well on this coming midterm. It will cover binary search trees, complexity, and sorts. All of which I had no trouble understanding.

My only worry is:

1. the fact that I have been able to find very few previous midterms, to give me any kind of an idea as to what  the next exam will look like.

2. Recursion rears its head again, although I have been able to write a few recursive functions, it takes me quite some time to write it, and I fear I might run out of time on the exam.

vendredi 1 novembre 2013

Binary Tree Nodes and Recursion

After several visits to office hours, as well as watching a few videos on Youtube. I think I finally understand (slightly) recursion. It comes at a good time, considering, A2 is due on November 5th and I'll need to know recursion in order to do the assignment.