Algorithms & Flowchart Definations


Algorithms
An algorithm is a step by step procedure for solving a problem in a finite amount of time

An algorithm is merely the sequence of steps taken to solve a Problem. The steps are normally:              "sequence,"
  "selection, "
  "iteration," and a case-type statement.

In C, "sequence statements" are imperatives.

The "selection" is the "if then else" statement and the iteration is satisfied by a number of statements, such as the "while," " do," and the "for," while the case type statement is satisfied by the "switch" statement.


Flowchart
Flow-chart is used to diagram a process on paper to make it easier to visualize. Flowchart can be useful in a variety of applications ranging from computer programming to managerial planning. A representation of algorithm and procedural logic of a program in a diagram that includes starting and ending points, procedures, modules, and decision-makings.

Flowcharts use standard geometric symbols and lines, which are connected according to the logic of the algorithm. Like pseudo code, flowcharts are useful for developing and representing algorithm, and it shows clearly how control structures operate.

Followers