1. It is a step-wise representation of a solution to a given problem, which makes it easy
to understand. 2. An algorithm uses a definite procedure. 3. It is not dependent on any programming language, so it is easy to understand for anyone even without programming knowledge. 4. Every step in an algorithm has its own logical sequence so it is easy to debug. 5. By using algorithm, the problem is broken down into smaller pieces or steps hence; it is easier for programmer to convert it into an actual program.
Disadvantages of Algorithms:
1. Algorithms are Time consuming.
2. Difficult to show Branching and Looping in Algorithms. 3. Big tasks are difficult to put in Algorithms.
Characteristics of Algorithms:
1. Precision – the steps are precisely stated (defined).
2. Uniqueness – results of each step are uniquely defined and only depend on the input and the result of the preceding steps. 3. Finiteness – the algorithm stops after a finite number of instructions are executed. 4. Input – the algorithm receives input. 5. Output – the algorithm produces output. 6. Generality – the algorithm applies to a set of inputs.