|
II-A. Sense conventional routes
The general sense lines liaison must be:
* Top to bottom
* Lr
II-B. Two examples of structures algorithmic
Prime example
This is Oscar's mother who calls and tells him:
Oscar course quickly to the grocery store, bought me a bar of butter, took the money in my purse, you dress well because it is cold.
If you create an application according to the specifications at our disposal, and this without creating the algorigramme, it will follow the following:
Oscar goes to the grocery store, calls for butter,
conditionnel1 treatment (Tc1) happens to the money?
No, not money,
then he returned to seek money,
conditionnel1 treatment (Tc1), happens to the money?
yes, then it takes butter, (T2c2) is he dressed?
No, back home are again, dressing,
go to the grocery store, the first Tec, answer yes, the second Tec, answer yes, return home and give butter a mother. END
This may seem sewn white wire for some, yet how often happens to resume a programme was simply because we had forgotten label, leaf, or a response to an error message.
This small example wants to show you q'un program is a logical sequence of events which s'enchaine to each other as a link in a chain of bicycle, and that if it lacks a link, or if the link n It is not in his seat, and the chain derailed.
|
