Algorithm

Introduction :

After the preparation of a suitable plan for developing the program by its logic. i.e., the correct sequence and procedure of instructions required to carryout the task, the algorithm is oftenly used to refer the logic of a program. It is one of the basic tool used to develop the problem solving.

* It is define as " a sequence of instructions designed in such a way that if the instructions are executed in the specified sequence, the desired results will be obtained", thus the algorithm should precise and unambiguous in practice and the results should obtained after a finite number of steps.

* It is also defined as "any problem whose solution can be expressed in a list executable instruction". By executing, we mean an instruction which an independent executor can actually perform, or carry out, in a step-by-step manner.

Characteristics of Algorithms :

In order to qualify an algorithm is a sequence of instructions, it must posses the following characteristics.

* In the Algorithms each and every instruction should be precise and unambiguous.

* The instructions in an algorithm should not be repeated infinitely.

* Ensure that the algorithm will ultimately terminate.

* The algorithm should be written in sequence.

* It looks like normal english.

* The desired result should be obtained only after the algorithm terminates.