TUTORIALS: DEFINITION, PROPERTIES AND CLASSIFICATION OF AN ALGORITHM

An algorithm is a step by step approach towards solving a particular problem.

PROPERTIES OF AN ALGORITHM

1. FINITENESS

An algorithm terminates after a number of steps, In other words it is not infinite.

2. DEFINITENESS

This involves each step in the algorithm being unambiguous. This means the action specified by the

step cannot be interpreted in multiple ways and can be performed without any confusion.

3. INPUT

An algorithm accepts zero (0) or more input.

4. OUTPUT

An algorithm must produce at least one (1) output.

5. EFFECTIVENESS

An algorithm must consist of basic instructions that are realizable. This means that the instructions can be performed by using the given input infinite number of time.

CLASSIFICATION OF AN ALGORITHM

1. BY IMPLEMENTATION

Under implementation we have different ways of implementing algorithms which are;

i. Recursion or Iteration

ii. Logical

iii. Serial/Parallel/Distributed

iv. Deterministic or Non-deterministic

v. Exact or Approximate

vi. Quantum Algorithm.

2. BY DESIGN PARADIGM

3. BY COMPLEXITY