Representation of Algorithms

The algorithms can be represented in several ways. Generally the programmers follow one of the following ways to represent an algorithms.

i. Normal english

ii. Flowchart 

iii. Pseudocode

iv. Decision table

v. Program

1. Normal English :

The algorithm can be easily represented in step by step sequential order in normal english, such algorithms are easy to understand, write and read.,

2. Flowchart :

The flowchart is a pictorial representation of an algorithm i.e., the sequential steps in an algorithm can be represented as a flowchart using the standard symbols.

3. Pseudocode :

The flowcharts are only one of the possible formal decision tools, whereas pseudocode is also a formal design tool and utilised very well with the rules of structured design and programming.

4. Decision Table :

A decision table helps a lot in designing a specific segment of a design. It provides another way to look at a complex, nested selection to help clarify the conditions to be tested and how those conditions should be nested to arrive at the proper actions.

5. Program :

The algorithms can be represented as a program using any high level languages, that become a program.