Algorithm
In mathematics and computing, an algorithm is a procedure (a finite set of
well-defined instructions) for accomplishing some task which, given an initial
state, will terminate in a defined end-state. The computational complexity and
efficient implementation of the algorithm are important in computing, and this
depends on suitable data structures.
Informally, the concept of an
algorithm is often illustrated by the example of a recipe, although many
algorithms are much more complex; algorithms often have steps that repeat
(iterate) or require decisions (such as logic or comparison). Algorithms can be
composed to create more complex algorithms.
The concept of an algorithm
originated as a means of recording procedures for solving mathematical problems
such as finding the common divisor of two numbers or multiplying two numbers.
The concept was formalized in 1936 through Alan Turing's Turing machines and
Alonzo Church's lambda calculus, which in turn formed the foundation of computer
science.
Most algorithms can be directly implemented by computer
programs; any other algorithms can at least in theory be simulated by computer
programs. In many programming languages, algorithms are implemented as functions
or procedures.
Citation:
Algorithm. (2006, November 12). In Wikipedia, The Free Encyclopedia.
Retrieved 07:15, November 12, 2006, from http://en.wikipedia.org/w/index.php?title=Algorithm&oldid=87295986