Algorythm course
Algorithms:
An algorithm consists of a whole structure ordering to a processor to realize in an accurate order a number of elementary tasks in the aim to solve a technical problem.
An algorithm can be described under a graphic form (Algorythm or Organisation chart) or under a literal form (algorithmic notation).
1.Linear structure.
One successively performs a series of actions in the order of their appearance.
Remark :
The structure may be limited to IF ... THEN, if the condition is true it executes the sequence A if it is false it leaves the structure without running sequence.
3.Iterative structure :
3.1 DO…UNTIL Structure
The sequence is executed at least once, it is repeated as it is true.
3.2 UNTIL…DO Structure
At first, one tests the condition. The sequence is executed until the condition is true.
3.3 FOR…DO Structure
One knows the number of iterations
Exemple: What is the aim of this program ?
Created with the Personal Edition of HelpNDoc: Benefits of a Help Authoring Tool