What is an “algorithm”?
The term algorithm is used in a variety of fields, including mathematics, computer programming, and linguistics. Its most well-accepted definition is something that consists of a finite list of instructions (which are well defined) that can be used to accomplish a task. Basically, when an algorithm is given some initial state, it will use the list of instructions to produce a variety of different, and sequential, states – eventually leading to the final or terminating state.
In its most general sense, an algorithm is any set of detailed instructions which results in a predictable end-state from a known beginning. Algorithms are only as good as the instructions given, however, and the result will be incorrect if the algorithm is not properly defined. A common example of an algorithm would be instructions for assembling a model airplane. Given the starting set of a number of marked pieces, one can follow the instructions given to result in a predictable end-state: the completed airplane. Misprints in the instructions, or a failure to properly follow a step will result in a faulty end product. A computer program is another pervasive example of an algorithm. Every computer program is simply a series of instructions (of varying degrees of complexity) in a specific order, designed to perform a specific task. Most conceptions of the human brain define all behavior — from the acquisition of food to falling in love — as the result of a complex algorithm. While ther
The word algorithm was derived from the name of a 9th century Persian mathematician and astronomer named Al-Khwarismi (the word “alkworism” can be heard by saying this name out loud, which was eventually translated into English as “algorithm), though its meaning has developed and grown a great deal since that time, and today has almost nothing to do with this ancient thinker.
One of the core topics of Computer Science is the study of ‘Algorithms’. What do we mean by an algorithm though? Just a series of actions to perform to get a job done. The study of algorithms is about coming up with such sequences that guarantee particular jobs are done. It is also about devising efficient ways of doing things. Two different ways of doing something could both guarantee to get the job done but one may be quicker than the other and so better. To get an idea of what I mean by that try the following puzzle. It is fairly easy to solve if you persist, but not so easy to do it efficiently – in the fewest number of moves. Each time you solve the puzzle you will create an algorithm for doing it that the applet records for you.
