Noocyada aasaasiga ah iyo tusaalayaal algorithms xilliile

Qodobka looga golleeyahay in lagu siiyo warbixin gaaban oo ka mid ah waxa Robin wareegsan, oo waa wax caadi ah in kasta oo heerka tababarka luqadda barnaamijyada iyo barnaamijyada.

Fikradda ah geynta ah

Geynta waa isku xigxiga oo ka mid ah falalka si loo gaadho xal in computer kasta ama dhibaato kale oo dhowr ah uguna tallaabooyinka. Tallaabooyinka (tilmaamaha) ee hirgelinta geynta ee waa la dili karaa mid ka dib markii kale ee (sequentially) waqti isku mid ah (ee isku midka ah) ama si kasta, iyadoo la isticmaalayo siddo iyo xaaladaha kala guurka. Algorithms waxaa loo isticmaalaa ma aha oo kaliya in barnaamijyada, laakiin sidoo kale meelo kale, tusaale ahaan maamulka geeddi-soo-saarka iyo ganacsiga.

Robin wareega

geynta waxaa lagu magacaabaa tiro xilliile ah haddii ay jiraan tallaabooyin ama nooc tallaabooyinka la sameeyeen in ka badan hal mar. falalka Soo noqnoqshada yihiin jidhka loop algorithmic. Intaa waxaa dheer, wareegga kasta uu leeyahay xaalad si ay u qabtaan a darafyadiisa geynta xilliile ah.

Noocyada algorithms xilliile

Robin kasta wareega daro xaalad loop a, E. Tibaaxda macquul ah in qeexayaa jeegga lagu qaban doonaa by jirka loop mar kale, ama wareegga waa complete ie.. Sida laga soo xigtay hab ka mid ah daaweynta oo dhan algorithms xilliile ah waxaa lagu qaybiyey saddex kooxood.

Cycle la shardi

In algorithms sida xaalad kordhin xilliile ah la hubiyaa ka hor inta processing jidhka loop ka, E. Waxaa loo baahan yahay in celcelin of wareegga nidaaminta ie..

Ka fikir lambarada daabacaadda -5 0 oo tusaale u ah algorithms xilliile shardi:

Qaybaha ee isku geynta ah:

1. Waxaan dhigay qiimaha bilowga ah ee j variable saldhigga, si siman u -5.
2. Waxaan ku baarnaa xaaladda loop ka. Xaaladda waa ay wanaagsan tahay, iyo jidhka la toogasho ah ku dileen markii ugu horeysay.
3. Dheeraad ah ku daray in ay unit j ah variable mar kale u hubiso xaaladda of loop ka.
4. Wareegga sii soconayo in loo sameeyaa ilaa qiimaha j uu ka yar yahay ama la mid ah eber, haddii kale baxdo wareegga of laan BEEN

Cycle la postcondition

imtixaanka shuruud lagu sameeyaa ka dib markii wareega ugu horeeya ee daaweynta, jidhka iyo ka talisaa wax soo saarka waxa ka.

Ina keena aynu xisaabi wadarta 1 ilaa tirada n oo tusaale u ah algorithms xilliile ah oo isticmaali postcondition:

1. Waxaan soo bandhigi n a tirada uguna xaddi xisaabinta iyo eber dhigay qiimaha bilowga ah ee wadarta guud ee wadarta iyo wareegga counter i.
2. loop waxaa toogasho ka hor shuruudaha imtixaanka ugu horeysay.
3. Hubi xaaladda wareegga, r. E. Qiimaha counter i uu ka yar yahay ama la mid ah n.
4. Haddii shuruudaha jawaabtu tahay mid togan, aan mar kale iterate, ama ku dhameysan wareegga iyo soo saarka tiriya inay soo bandhigay ama daabacaadda.

wareegga shuruud la'aan

Sida caadiga ah loo isticmaalo ee algorithms, marka tirada doonayo ee iterations loop la og yahay ka hor, oo waxaa badanaa loo isticmaalaa marka la Arrays shaqeeya.

geynta Tani waxay ka kooban tahay saddex qaybood oo khasab ah:

1. qiimaha bilowga, oo la yidhaahdo dhimaya wareeg, t. K. variable Tani waa dib u habaynta kadib markii wareegga dil kasta, iyo go'aaminaya markii ay dhamaystirka.
2. Qiimaha at kaas oo loop ku joojiso.
3. wareegga Step.

Halkaa marka ay marayso kasta, barnaamijka wuxuu hubinayaa in si loo arko haddii qiimaha bilowga ka badan finalka. Oo haddii ay sidaas tahay, markaa wareegga la soo gabagabeeyo. Haddii kale, qiimaha lagu darayaa laga bilaabo size tallaabada soona celin wareegga. Waxa xusid gaar ah waa in wax loop shuruud la'aan lagu bedeli karaa horudhaca ah shuruudaysan ama postcondition.

In ay barbaro galeen ilaa Robin ku wareegsan oo lagama maarmaan ah inay raacaan labada xaaladaha khasab ah. marka hore waa in la soo afjaro wareegga, waxaa lagama maarmaan ah in ay ka kooban birta jirka saameeyey ama shardi, haddii kale waxaan ugu dambeyntii ka heli kartaa loop ah la koobi karayn. Laakiin qaar ka mid ah wareegyada sida loo isticmaalo codsiyada software. Tusaale ahaan of algorithms xilliile ah in muddo aan ordo, aad keeni kartaa nidaamka Windows ee ka hawlgala, taas oo uu isticmaalaa ah ra'yiururin loop dhammaadka lahayn jiirka si loo ogaado falalka user ee. Second, doorsoomayaal si ay wareegga maray waa inay bixiyaan ugu yaraan mid ka mid ah uu dil.

Xisaabinta factorial ah

Si aad u xoojiyaan akhriska siin doonaa tusaale ka mid ah algorithms xilliile ah si ay u xisaabiso factorial ee abyoonaha ah. Tusaale ahaan Tani waa wareeg ah la shardi ah laakiin la fulin karo by nooc kasta oo Robin wareegsan.

• xogta aasaasiga ah, xogta - abyoonaha ah, wixii la goostay ayaa for factorial ah.
• Doorsoomeyaasha System: Cycle dhimaya i, taas oo qiimaha qaadataa 1 ilaa talaabo xogta c 1.
• Result: variable factorial - xogta factorial, taas oo waa wax soo saarka ee abyoonayaasha 1 ilaa xogta.

Tixgeli tallaabo geynta by tallaabada:

1. geynta ayaa helay tirada xogta, taas oo aad rabto in aad xisaabiso factorial ah.
2. Of variable factorial, taas oo ku urursan doonaa natiijada kama dambaysta ah, ayaa lagu wadaa in midnimada.
3. Waxaan abaabuli wareegga dhimaya i iyo qiimaha bilowga 1. Qiimaha finalka uu noqon doono xogta tirada asalka ah. Marka qiimaha counter i waa weyn, loop ku joojiso.
4. xisaabinta loop waxaa la sameeyaa factorial - qiimaha hadda factorial tarantaan oo aad i counter ah.
5. By ku daray mid ka mid ah in qiimaha miiska, loop xaalad jeegga, iyo haddii jawaabtu tahay mid togan, waxaa buuxinaya.
6. Kadib markii uu dhamaystay wareegga, siyaalaha ugu dambeeyay ee qiimaha xogta factorial! Waxaa weli ku jira factorial oo soo bandhigay ama ku daabacan.