An algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
Algorithm is a step-by-step procedure for calculations.
A flowchart is a type of diagram that represents an algorithm, workflow or process, showing the steps as boxes of various kinds, and their order by connecting them with arrows.
Types of Flowchart
- a processing step, usually called activity, and denoted as a rectangular box
- a decision, usually denoted as a diamond.
Sterneckert (2003) suggested that flowcharts can be modeled from the perspective of different user groups (such as managers, system analysts and clerks) and that there are four general types:[11]
• Document flowcharts, showing controls over a document-flow through a system
• Data flowcharts, showing controls over a data-flow in a system
• System flowcharts showing controls at a physical or resource level
• Program flowchart, showing the controls in a program within a system
The major symbols are the DECISION (also known as selection) and the SEQUENCE (or process) symbols. The START and STOP symbols are called the terminals. The SUBPROCESS symbol is a variation on the sequence symbol. There are also connectors drawn between the symbols and you will see these used in the examples below. There is at least one other sequence symbol which is used to represent input/output processes.
There are some important rules concerning the symbols and these rules apply also to other ways of stating algorithms:
Processes have only one entry point and one exit point.
Decisions have only one entry point, one TRUE exit point and one FALSE exit point.
The first structured method for documenting process flow, the "flow process chart", was introduced by Frank Gilbreth to members of the American Society of Mechanical Engineers (ASME) in 1921 in the presentation