Term test is now over, and the lecture which followed (algorithm) went smoothly.
The definition of "algorithm", according to Dictionary.com, is "a set of rules for solving a problem in a finite number of steps, as for finding the greatest common divisor". As a result, the conceptual understanding of algorithm is pretty straightforward to learn; it is basically a set of procedures. One way of thinking about it is to vision those awful chemistry lab procedures in high school - after each step, whoever is reading the report will know exactly what to do, and how to do it properly. This is to ensure that you don't end up taking a big sniff of an 18 mol/L sulfuric acid when you're uncertain of its identity. Algorithm is crucial in computer programming because when programs are designed, they need to follow a certain set of rules, and those rules must encompass a wide variety of situations and solutions.
So I just had some instant noodles before typing this. To cement my comprehension of algorithm, I will explain the process which I undertook to purchase that cup of noodles:
1) Commute to Café Reznikoff
2) Enter from the automatic door that has the sticker "enter"
3) Turn your head left upon entering, and walk straight until you see several cups of noodles
4) Take how many you need
5) Pay for it (skip this step and you may be arrested!)
6) Leave from the automatic door on the left side
This is of course a simple algorithm, and the details of many "useful" real world examples are extremely intricate. Nevertheless, I will try and develop my skills from here on.
Hopefully I'll find something else to post next week,
Until then, piece out!
No comments:
Post a Comment