Algorithm Definition
An algorithm is a series of
specific steps which solve a particular problem.
Each word in the definition above is important:
·
series
The
steps must be done in a particular order and each of the steps must be used (unless the algorithm
says otherwise).
·
specific
A
step must NOT be replaced by a similar
step.
·
steps
Like
a cooking recipe, an algorithm tells you to do things. Each thing you do is
called a step (aka instruction, aka command)
·
solve
An algorithm produces a final result (aka output) which is the solution to a problem.
·
particular problem
The algorithm for one problem
will not usually solve a different
problem.
The details defining the problem must be made available at the start of the
algorithm. These details are called givens. (aka parameters).
Characteristics
of an Algorithm
Not all procedures can be
called an algorithm. An algorithm should have the following characteristics.
· Unambiguous −
Algorithm should be clear and unambiguous. Each of its steps (or phases), and
their inputs/outputs should be clear and must lead to only one meaning.
· Input − An algorithm
should have 0 or more well-defined inputs.
· Output − An algorithm
should have 1 or more well-defined outputs, and should match the desired
output.
·
Finiteness −
Algorithms must terminate after a finite number of steps.
·
Feasibility −
Should be feasible with the available resources.
· Independent −
An algorithm should have step-by-step directions, which should be independent
of any programming code.
https://www.tutorialspoint.com/data_structures_algorithms/algorithms_basics.htm
http://erdoganakbiyik.blogspot.com/
