Characteristics of Algorithm

Algorithms are the step-by-step instructions to designed perform an specific task. The major Characteristics of an Algorithm are:

Precision and Clarity :
                      Each and Every steps written precisely and must have an clear meaning. An single step must not contain double meaning i.e. each instruction must be free from ambiguity

Finiteness :  
                     An algorithm must come to an end at an certain point i.e. it must contain an stopping condition and exit from the process if an certain condition is true. The steps to conduct an specific operation must be finite in number, an algorithm must not enter in an endless loop or cycles of instructions.

Effectiveness:
                      Effectiveness means each instruction must be the basic form to carry out an operation. i.e. unwanted instructions that don't affect the output in anyway must be removed.

Input:
        An algorithm has an finite number of input may be zero.But it should not keep taking inputs from the user leading it into an endless loop.

Output:
          An algorithm once completed must give the desired output or complete the given operation correctly.

An algorithm should be work correctly regardless of what computer language the programmer uses.