So heres my thoughts on week 4. More induction! Except this time, we use induction on recursively defined functions. Recursion is pretty straight forward (unless you need to figure out how to code it at times) but when I'm doing computer science my brain does not want to think in terms of math, therefore I don't like "unwrapping". But I must admit, I have always found the Fibonacci patterns, despite their recursive nature, quite interest. Next we looked at binary trees and I rather enjoyed this proof. I'm not sure I would have easily seen the idea of "unwrapping" in order to keep both values in the equation relatively similar and I am glad to have seen this now, rather than on the test for the first time.
Yet there is one thing about this week's lecture, and I am asuming from hereon out, that I am beginning to think will frustrate me slightly. We are done with python, and all these problems with python sure aren't helping me remember my java syntax from highschool. I'm sure there's people who were are not required to begin learning java and appreciate the problems being in python but I am wondering if test questions can be written in our programming language of choice. Speaking off the test, it's tommorow! ahh!
1 comment:
Which language to use in examples --- that would probably make a good poll or something. I read/write both, but I find python has less overhead for expressing simple algorithms. On the other hand, I have java code from older versions of this course.
Post a Comment