Basic daban da kuma misalai na cyclic Algorithms

Mataki na ashirin da nufin bayar da tushen fahimtar abin da a zagaye robin, wanda su ne na kowa da duk wani shirye-shirye da harshen da kuma shirye-shiryen da horo matakin.

A ra'ayi na algorithm

Shikenan lissafin ne a jerin ayyuka don cimma wani bayani da kowace kwamfuta ko wasu matsala a wani guntun yawan matakai. Ayyuka (umarnin) domin aiwatar da algorithm za a iya kashe daya bayan daya (sequentially) a lokaci guda (a cikin layi daya) ko a wani tsari, ta yin amfani da madaukai da kuma yanayi na miƙa mulki. Algorithms ana amfani ba kawai a cikin shirye-shirye, amma kuma a wasu yankunan, misali a gudanar da samarwa da kuma kasuwanci tafiyar matakai.

zagaye robin

A algorithm aka kira cyclic idan akwai ayyuka ko sets na ayyuka da za a yi fiye da sau daya. Maimaita ayyuka ne algorithmic madauki jiki. Bugu da ƙari, kowane sake zagayowar yana da wani yanayin yin wani cyclic algorithm iyakar.

Iri cyclic Algorithms

Kowane zagaye robin kunshi madauki yanayin, watau. E. Da ma'ana magana cewa ma'anar rajistan za a za'ayi da madauki jiki sake, ko sake zagayowar ne duka. A cewar wani Hanyar zalunta duk cyclic Algorithms kasu kashi uku kungiyoyin.

Da'ira da na kafin lokaci

A cikin irin wannan lissafi mai tsauri cyclic tsawo yanayin da aka bari kafin aiki na madauki jiki, watau. E. Akwai bukatar maimaitawa na aiki zagayowar.

La'akari da bugu lambobin -5 zuwa 0 matsayin misali na cyclic lissafi mai tsauri na kafin lokaci:

Abubuwa na algorithm:

1. Mun kafa na farko da darajar da tushe m j, daidai -5.
2. Mu duba da yanayin da madauki. A yanayin ne tabbatacce, kuma jiki ne hukuncin kisa a karon farko.
3. Bugu da ari kara wa m j naúrar sake duba da yanayin da madauki.
4. A sake zagayowar ci gaba da za a yi har da darajar j ne kasa fi ko daidai to sifili, in ba haka ba fita sake zagayowar na reshe KARYA

Da'ira da postcondition

Tasari gwajin da aka yi, bayan na farko da magani sake zagayowar, cikin jiki da kuma iko da fitarwa daga gare ta.

Bari mu lissafi da Miliyan Xari daga 1 ga yawan n matsayin misali na cyclic lissafi mai tsauri wanda amfani da postcondition:

1. Mun gabatar da wani guntun yawan n na lissafi adadin da kafa sifili na farko darajar total Jimlar ware Naira Miliyan Xari da kuma sake zagayowar counter i.
2. A madauki da aka kashe kafin na farko gwajin yanayi.
3. Duba yanayin sake zagayowar, r. E. The counter darajar i ne kasa fi ko daidai to n.
4. Idan da sharuddan da sakamakon ne tabbatacce, mun iterate sake, ko gama da sake zagayowar da jimloli da Naira Miliyan Xari da nuni, ko bugu.

mika wuyansu da sake zagayowar

Kullum amfani a cikin lissafi mai tsauri, a lokacin da ake so yawan madauki iterations da aka sani a gaba, kuma sau da yawa yana amfani da lokacin da yin aiki tare da iri-iri.

Wannan algorithm qunshi uku m aka gyara:

1. A farkon darajar, wanda aka kira a sake zagayowar siga, t. K. Wannan m ne modified bayan kowane kisa sake zagayowar, da kuma kayyade lokaci na ƙarshe.
2. The darajar a da madauki terminates.
3. Mataki sake zagayowar.

A kowane lokaci, da shirin jami'in dake duba yawan ganin idan da farko darajar wuce karshe. Kuma idan haka ne, to da sake zagayowar da aka kammala. In ba haka ba, da darajar da aka kara wa fara mataki size da kuma sake zagayowar maimata da ita. Na musamman bayanin kula ne da cewa wani mika wuyansu da madauki za a iya maye gurbinsu da wani matukar xabi'a ko postcondition.

A jawo sama da zagaye robin wajibi ne a bi su biyu m yanayi. Na farko shi ne na kawo karshen sake zagayowar, shi ne cewa wajibi ne da abinda ke ciki na jiki shafa post ko na kafin lokaci, in ba haka ba za mu karshe iya samun wani iyaka madauki. Amma ga wasu irin hawan keke amfani da software aikace-aikace. A matsayin misali na cyclic Algorithms cewa gudu illa ma sha Allahu, za ka iya sa da Windows aiki tsarin, wanda yana amfani da wani m madauki zabe cikin linzamin kwamfuta domin sanin mai amfani da ayyuka. Na biyu, masu canji ya wuce zuwa da sake zagayowar kamata samar da akalla daya daga kisa.

A lissafi na factorial

Don ƙarfafa da karatu zai ba da wani misali na cyclic Algorithms yin lissafi da factorial na wani lamba. Wannan misali ne a sake zagayowar tare da na kafin lokaci amma za a iya aiwatar da wani irin zagaye robin.

• Baseline data: data - wani lamba, wadda aka ƙaddara ga factorial.
• Tsarin canji: da'ira siga i, wanda daukan dabi'u daga 1 zuwa Mataki data c 1.
• Result: factorial m - factorial data, wanda yake shi ne samfurin na integers daga 1 zuwa data.

Ka yi la'akari da algorithm mataki-mataki:

1. A algorithm ya samu yawan data, wanda ka so yin lissafi da factorial.
2. Na factorial m, wanda zai adana karshe sakamakon, an saita zuwa hadin kai.
3. Mun shirya sake zagayowar siga i da farko darajar 1. A karshe darajar zai zama ainihin lambar data. Da zarar darajar counter i ya fi girma, madauki terminates.
4. Kalaman lissafi aka yi factorial - factorial halin yanzu dabi'u suna yawaita da kuma counter i.
5. Ta ƙara daya zuwa counter darajar, da yanayin rajistan shiga madauki, kuma idan sakamakon ne tabbatacce, kammala shi.
6. Bayan kammala sake zagayowar, da latest iteration na darajar factorial data! Ya zauna a factorial da kuma nuna ko buga.