AmakhompiyuthaUkuhlela

Okuwusizo ngenkathi i-loop yomqambi

Umqambi wokuqala angase angazi ukuthi iyodwa ewusizo ngenkathi i-loop. Lokhu kuyindlela yokusebenza yama-cyclic evamile emvelweni wePascal. Kungcono ukusebenzisa emisebenzini ehlukahlukene, ngakho sizohlaziya ukuthi ungafaka kanjani lo mjikelezo ohlelweni .

Lo mjikelezo, uPascal udinga ifomethi elandelayo:

  • Ngesikhathi (Isimo) senza (qala uma kunesidingo).
  • I-Algorithm yesenzo.
  • Qeda (uma kukhona umyalo wokuqala).

Umzila wokuqala "i-cap" yomyalo. Isimo singaba yinani lezinombolo ezilinganiselwe ze-Integer eguquguqukayo (d <100), inani lokuguquguquka kohlobo lwe-boolean (t = True) noma string (tex = 'hello'). Umyalo "uqale" usethe uma ngabe ngaphezulu kwesinye isimo kufanele sigcwaliseke emzimbeni we-loop. Okulandelayo incazelo yezenzo okufanele zenziwe ohlelweni, ngaphandle kokuthi i-Loop ngenkathi isenziwa. Ingaba nemiyalo ehlukahlukene, izinqubo, imisebenzi, njengemijikelezo. Ekugcineni, udinga ukubeka umyalo "ekupheleni", uma, impela, umugqa wokuqala "uqale".

Manje cabanga ngezibonelo zezinhlelo eziqukethe umyalo ochaziwe. Isibonelo, sidinga ukuthola inani lezinombolo zokuqala ezingu-n. Ngenxa yalokhu, ekuqaleni sithatha n (ake njalo kube mkhulu kunezinga). Bese uqala loop. Kubalulekile ukuqonda ukuthi kufanele isebenze ize ifinyelele inani lenombolo n. Kukhona isisombululo esingaphezu kwesinye senkinga, kodwa sizogxila kulowo othinta ukusetshenziswa kwe-counter okumele ifakwe. Ngokuzenzakalelayo, okuguquguqukayo i isetshenziselwa lokhu. Ngaphambi kokuba uqale ukusebenza nayo, kufanele uyinikeze inani "1". I-counter isebenza njengegama lesenzo ngasinye esisha se-cyclic. Ngokusekelwe emsebenzini wethu, sihlale sidinga ukungeza eyodwa kuso. Ngakho, ngolunye usuku inamba yezinombolo izolingana nenani lenombolo n. Lokhu kuzoba uphawu lokuqeda uhlelo. Ukuze sibone inani, sethula ukuguquguquka k. Ngokuphindaphinda okusha, kuzokwabiwa inani langaphambilini kanye nenombolo i. Ngemuva kokubala kokugcina, kufanele unikeze kuphela okokuqala kwesikrini. Lena incazelo emfushane yalolu hlelo ngamazwi. Manje sibheke ikhodi yohlelo.

Readln (n); '- funda inombolo n.

I: = 1; K: = 0; '- senza ukusebenza ku-counter, senza kabusha inani lemali.

Ngesikhathi i <= n iqala '- setha isimo se-loop.

K: = k + i; I: = i + 1; '- engeza inani ngenani, buyekeza i-counter.

Qeda; '- sigcwalisa incazelo yeNkathi.

Umbhalo (k); - ukukhipha idatha.

Ake sijwayelane nesibonelo esisodwa. Manje sidinga umsebenzisi ukuthi agcwalise amagama akhe kusuka kukhibhodi, ezogcina isitoreji sombhalo. Isimiso lapha sifana nesikhathi esidlule. Faka inamba n, qalisa i-Loop ngenkathi usubeka, setha isimo. Ngaphezu kwalokho, sisho okokufaka kusuka kwekhibhodi enkumbulweni yeselula ye-array. Sabeka i-counter, sifeza ukusebenza okuphindaphindiwe. Okulandelayo, setha kabusha i-counter bese uphuma uhlu. Kuyiqiniso, ukusetha kabusha i-counter kule mongo kusho ukusinika inani elilodwa, ngoba awukwazi ukubonisa i-zero cell of the array (ayikho). Ikhodi yalolu hlelo kanje: kusukela kulolu hlelo uzothola isamba sochungechunge lwezinombolo ezihle zendalo, oluphela ngenombolo engenisiwe n. Kumele kucatshangwe ukuthi uma kungabikho i-counter, i-While Pascal loop ingapheli. Uma ngokungazelelwe ukhohlwe ngalokhu, ke uma uqhuba ikhodi yohlelo, ikhompyutha izoqala ukuxhuma. Lokhu kuphathwa nge inkinobho ethi "Pause Break". Njengompikiswano yezinto ezihlukahlukene, sebenzisa okuguquguqukayo c.

Readln (n);

C: = 1;

Ngesikhathi c <= n uqala '- ukubeka isimo.

Funda u-[c]); C: = c + 1; '- funda idatha kusuka kwikhibhodi, engeza inani ku-counter.

Qeda; '- siqedile umjikelezo.

C: = 1; '- buyisela inani lokuqala ku-counter.

Ngesikhathi c <= n ubhala (a [c]); '- bonisa amagama.

Emva kwalokho uzothola amagama angesikrinini, afakwe phakathi kwekhibhodi. Kulokhu ujwayelene nalokhu Umjikelezo uphela. Isetshenziswa kokubili ngabaqalayo nabasebenzisi abakhulu. Ayinayo i-counter, ngakho-ke idinga ukunakekelwa okhethekile kumklami kanye nendawo ehlukile.

Similar articles

 

 

 

 

Trending Now

 

 

 

 

Newest

Copyright © 2018 zu.unansea.com. Theme powered by WordPress.