Friday, 31 January 2014

Recursion is hard

Ahhh that comp-sci life. Onlookers unfamiliar with it are often, one might say, "afraid" of even trying to comprehend the mind of a computer. Why is that? Is it because of the complex algorithms involved? the advanced calculus methods? or perhaps, the fact its English words that don't make English sense. A computer language is (almost) like a completely different language, at least to those who don't understand it. It is as intimidating to the laypeople as trying to read french with only an elementary school french education. Once you get over that and you can understand it, the real difficulties begin, as many would say who are taking 148. A difficult example would be recursion, which, might not seem to sound scary, but is so infinity deep, it can be quite daunting. In high school, when we learned recursion, I hated it. I could always solve the questions she asked us to solve with recursion very quickly without it, more efficiently. When we first started learning recursion, the first example we used, I couldn't solve without using recursion (at least not faster than recursion itself). It is a little intimidating because I have difficulty comprehending recursive algorithms. Hopefully with a little practice ill be able to master it. Only time will tell.

No comments:

Post a Comment