This week, our class focused on the introduction of algorithm: its definition, its features, its functions, and methods to create it.
To give us a preview of algorithms, Mr. Pete asked us to play the online game Lightbot.
In this game, our goal was to control the little robot to light all the blue blocks in each map by creating an algorithm within a limited number of simple instructions. During the playing process, we learned how to enhance the efficiency of an algorithm by appropriately using procedures, which are separate series of instructions that can be directly used in the main algorithm, and loops, which allows one set of instruction to repeat its self to save the total number of instructions.
The definition of an algorithm is introduced to us in class as “a step by step clear instructions to solve a problem.” The terms “step by step” and “clear” were especially emphasized in class, and it was illustrated by creating an “algorithm” to boil an egg in class activity. We knew that it is very important for an algorithm to be accurate, concise, and constructed by simple steps. In another way, the features of an algorithm can be summarized as “finiteness”, “definiteness”, “input”, output”, and “effectiveness”.
It is also important that algorithm makers should have a very clear goal throughout the process of writing one. He/she should be understanding the big picture, in other words, what the real problem is. In order to do that, the input, output, order, decisions and repetition. The visual expression of an algorithm: the pseudocode, is thus applied to clarify all those components of a problem and offer solutions in the form of a flowchart.
Ways to express an algorithm include the pseudocode, the flowchart, the natural language, and the programming language. Our class focused mainly on the former to types.
This is a display of common notations of the pseudocode. It is often written in very standardized forms so that a system (such as a computer) can operate those instructions correctly.
Jason's Blog 