Cycle for: Pascal bilowga ah

Mashaariiceed Fundamentals - wareegyada, tusaale ahaan, waayo. Pascal. Sida luqada computer kasta, waxaa kale oo ku jira naqshado sida ay Saan.

Magacaabidda shaqeeya xilliile

Hawsha A caadiga ah - si aad u hesho computer ka si ay u qabtaan tallaabo la mid ah dhowr jeer. Halkan iyo badbaadin design, taasoo u ogolaatay in uu abaabulo soo noq-code ka. Sayidka, wareegga ah ee barnaamijyada - waxaa si joogta ah loo isticmaalo si ay u qabtaan ficil, abaabulan oo gargaar ka ilaha luqadda.

luqadda barnaamijyada Pascal waxaa ka mid ah tiro ka mid ah naqshado:

• waayo - celi la dhimaya ah;
• halka - waxaa soo noqnoqda la shardi ah;
• ku celi ... ilaa - Celin postcondition ah.

In kasta oo xog-naxdo iyo Hufnaan dhismayaasha xilliile ah, barnaamijyo laylis wajihi tiro ka mid ah dhibaatooyinka ay fulinta. dhib ugu weyn waa xaaladaha goob wax soo saarka ee wareegga. Marka tan la eegayo, tirinta for war waa ugu sahlan.

Qaab-dhismeedka

Si ay u qoraan dhismeedka celis la dhimaya ah, waxaad u baahan tahay wac code soo socda:

LOOGU TALAGALAY {a}: = {b } TO {c} SAMAYN {d}.

In tusaale ahaan erayada rights reserved afka sahlaansashada xarfaha, ku dhaqanka, waxaad isticmaali kartaa sumadda string ah. doorsoomayaasha la isticmaalay iyo ka shaqeeya waa la siiyaa oo qows ku kuweyga. Waxay ka dhigan tahay:

• {A} - variable nooc kasta oo la tirin karo, inta badan abyoonaha;
• {C} {B}, - hadal nooca la tirin karo, la mid ah sida {a};
• {D} - wadaha aan loo aabo yeelin / ka shaqeeya luqadda, sidoo kale loo yaqaan jidhka loop ka.

Tababbar design waayo, Pascal xisaabinaya qiimaha {b}, {nooc ah}: = c {} , ka dibna uu bilaabo ogalanaya:

• xaqiijinta xaaladda {b} <= {c} , at taas oo wareegga dil istaago shaqada;
• Daah operator {d};
• sii kordhaya qiimaha {a} on unugga, i.e. {a}: = {a} + 1.

Sababtoo ah tirada celin jirka ah ee loo yaqaan dhismaha this gudahood tixraac wareegyada deterministic.

tusaale ahaan

Si loo fahmo sida loo fulin doono, waayo, iwm, waa tusaale, code ee Pascal ee "Kadaabad".

• s: = 0;
• for a: = 1 ilaa 5 samayn
• bilaabaan
• s: = s + a;
• inuu dhamaado;
• writeln (s);

Falanqaynta tilmaamaha ku qoran qori kartaa qiimaha ee siyaalaha kasta:

• siyaalaha 1aad: a = 1; s = 1;
• siyaalaha 2aad: a = 2; s = 3;
• siyaalaha Saddexaad: a = 3; s = 6;
• siyaalaha 4-th: a = 4; s = 10;
• siyaalaha 5aad: a = 5; s = 15.

Sidaas darteed, user u arko shaashadda tirada "15" - wadarta tirooyinka 1 ilaa 5.

Si aad barnaamijka ugu horeysay ka badan boosaska badan, bedelo tirada 1 iyo 5 doorsoomayaasha.

qaladaad Common

Marka aad isticmaasho a for loop, Pascal u baahan fiiro taxadir in qiyamka {a}, {b}, {c}. Haddii aadan raacin xeerarka barnaamijyada qoraal, compiler sheegi doonaa qalad. Shan sharciyada sida.

1. Counter (dhimaya wareegga) {a} waxaa la siiyaa by abyoonaha ah.
2. qiimaha {b} iyo {c} waa in sidoo kale waxay leeyihiin nooca abyoonaha ah. Tusaale ahaan, waxaa lagama maarmaan ah si loo xisaabiyo qiimaha of xagal, in halbeegga ka bilaabmaysa 0 ilaa p. Laakiin soo galo code soo socda uu noqon doono baadil ah: = 0 ilaa pi sameeyo. Solution - isticmaalaan soo aruurinta trunc shaqo ah () iyo hareeraheeda (). First iska xoorayaa qaybta jajab ee tirada dhabta ah, labaad - waxaa ku wareegsanaa inay abyoonaha ee kuugu dhow.
3. Haddii user ayaa qalad sameeyay oo ay leeyihiin {b} <{c}, {d} operator marnaba shaqayn doona.
4. Ka dib markii performing counter loop ka {a} waxaa laga yaabaa in qiimaha kasta. Inkastoo ay soo horjeedda, laakiin dhab ahaan, {a} <> {c} . Gunaanad: ha u noqon oo aanay {a} ka dib markii design ee.
5. Jirku wuxuu of loop ah (in uu yahay, ka dib markii erayada samayn) laguma talinayo in la isticmaalo statements kasta oo ka beddeli qiimaha dhimaya ah {a}. Ka dib markii xeerkan ma ka dhigi doonaa in qalad, laakiin macquulka ah ee barnaamijka waa la burburin doonaa.

xeerka soo socda waa caadi ah oo u dhiganta ee "asluubta wanaagsan" ee barnaamijyada, waayo, kaasu wuxuu ahaa habboon in la code ka shaqeeyaan, waa in aad ku qor shaqeeya jirka loop ma aha in tiirka ugu horeysay. Tusaale ahaan, samaynta 2-3 meelaha bidixda ama badhanka Tab ah.

looga baahan yahay Tani waa dabaqi karo ma aha oo kaliya in ay afka Pascal. Waayo, "caagagga", waxa kuu ogolaanayaa inaad si aad u hesho oo la saxo qaladka tilmaamaha.

hawlaha Common

Ka soo qaad aad rabto si ay u qabtaan shaqo tabulation foomka f (x) = 3 * x + 15, in ay tahay in ay miiska ka qiyamka M shaqo helaan kala duwan [x _1, x _2] halkaas oo x ₁ iyo ₂ x - ugu yaraan iyo ugu badnaan qiimaha doodda. Si loo xaliyo taas oo la mid ah dhibaatooyinka ka caawisaa in ay qorshayso waayo. Pascal ku talinaysaa in aad u qoraan xeerka sida soo socota:

• for a: = 1 ilaa M samayn
• bilaabaan
• x: = x1 + (x2- x1) * (a- 1) / (M-1);
• f: = 3 * x + 15;
• writeln (x, '', f );
• dhamaadka.

Tan iyo markii x inremantiga aan la dhigay, qiimaha muran loo xisaabiyo inta lagu guda jiro siyaalaha kasta oo barnaamijka isticmaalaya formula ah: x: = x1 + (x2- x1) * (a- 1) / (M-1).

Wareegga in wareegga

In view of xaqiiqda ah in gudahood qaabka loo ogol yahay in ay isticmaalaan wax kasta oo ka shaqeeya loo oggol yahay in jirkeeda la gelin wareegga kale. Pascal ayaa sharaxaad caadiga ah ee hawsha, la mid ah luqadaha kale barnaamijyo:

• LOOGU TALAGALAY {a}: = {b } TO {c} SAMAYN
• LOOGU TALAGALAY {A1}: = {B1 } TO {C1} SAMAYN

Si aad u qorsheeyo si sax ah u shaqeeyo, waa in aad u hoggaansamaan xaaladda: counters in wareegga kasta waa in ay kala duwan. Haddii kale, loop gudaha beddeli doonaa qiimaha of loop dibadda, taasoo keeni doonta in qalad macquul ah.