A kashi: shirye-shirye, abubuwa, aka gyara, yi

A yau duniya na dijital fasaha shi ne dalilin da shirye-shirye daban-daban kwakwalwa, na'urori da sauran kayan lantarki. Kuma da ikon da sauri da kuma daidai ƙirƙirar kwarara ginshiƙi hidima da tushe, tushen da kimiyya. Wannan makirci ne da aka zana model na aiwatar da cewa dole ne a bi kayan aiki. Ya kunshi mutum aikin raka'a cewa yin daban-daban nufi (farawa / karshen shigar / fitarwa, wani aiki da kira, da kuma sauransu. D.).

Shikenan lissafin da algorithmization

A gaskiya, da algorithm ne na kowa wa'azi a kan jerin a cikin abin da dole ne ka yi wasu matakai a cikin aiki da raw bayanai zuwa da ake so sakamakon. Bugu da kari, cikin lokaci ne sau da yawa amfani da manufar algorithmic. An fahimci matsayin sa na hanyoyi da dabaru na jawo sama jerin ga takamaiman ayyuka.

Sau da yawa, shikenan lissafin ba a amfani da matsayin jagora ga kwamfuta, kazalika da makirci yin wani mataki. Wannan ya sa ya yiwu a lura da yadda ya dace da kuma tasiri na wannan tsari mafita, to gyara wani kurakurai, da kuma kwatanta shi da sauran irin wannan mafita kafin gabatarwar da kwamfuta. Bugu da kari, da algorithm ne dalilin da halitta na shirin cewa kana so ka rubuta a wani shirye-shirye da harshen, domin karfafa huldar da ke aiwatar da bayanai aiki a kan PC. Yau zo zuwa martabar biyu m hanyoyi na gina wannan jerin. Na farko shi ne kari fi'ili description, da kuma na biyu - a kashi matsala. A farko daga cikinsu shi muhimmanci kasa na kowa. Wannan shi ne saboda da rashin tsabta, da verbosity. Na biyu Hanyar, a akasin haka, shi ne wani sosai dace wajen wani image jerin. An yadu rarraba biyu a horo da kuma a cikin kimiyya wallafe-wallafe.

abubuwa flowcharts

A block zane na shirin algorithm ne a jerin mai hoto haruffa danganci yi takamaiman aiki, kazalika da alakar da ke tsakanin su. A cikin kowanne daga wadannan hotunan ƙunshi bayani game da aikin da za a yi. A size da kuma sanyi na mai hoto hali, da kuma tsari na rajista jerin kayyade Gost 19003-80 da Gost 19002-80.

La'akari da ainihin abubuwan da ya kwarara ginshiƙi (a cikin photo bayar da misalai na da maki).

1. Tsari - sarrafa kwamfuta mataki ko jerin ayyuka.

2. Magani - Duba kayyade yanayi.

3. gyara - zagayowar BBC.

4. The saitaccen tsari - makõma zuwa ga hanya.

5. daftarin aiki - bugu kuma data fitarwa.

6. The naushi cards - shigar da bayanai.

7. I / O - shigar da / fitarwa.

8. Connector - rata juyi Lines.

9. Fara / Tsaida - fara, karshen, daina, fara, shigar da fitarwa ake amfani da karin lissafi mai tsauri.

10. Comment - da ake amfani da ajiye placards.

11. A tsaye kuma a kwance gudana - shugabanci na jerin, da mahada tsakanin tubalan.

12. tattara abubuwa masu kyau - fili gudana.

13. Interstitial connector - mark NUNA a miƙa mulki ga wata takardar.

dokokin allo

A yi na kwarara ginshiƙi ne da za'ayi a kan takamaiman bukatun rattaba kalma Gost. Alal misali, kawai a kwance, ko a tsaye Lines ake amfani a tare hoto alamomin. Gudana daga dama zuwa hagu, kuma daga kasa zuwa saman, ko da yaushe alama ta kibiyoyi. Sauran Lines iya ba za a alama. A nisa tsakanin layi daya kõguna ya kamata ba kasa da uku millimeters, kuma tsakanin sauran abubuwa - ba kasa da biyar millimeters. Block size dole ne a mahara na biyar. A rabo daga kwance zuwa tsaye hoto alama ne 1.5. Wani lokaci yana iya zama daidai da biyu. Domin saukaka description, graphics ya kamata a ƙidaya. By yanayin Hadin rarrabe iri kashi mikakke, cyclic da kuma sashe tsarin.

Canji, constants da memory Kwayoyin

Domin mafi fahimtar da aiki manufa na algorithm za a iya daukan wani sauki inji. Yana da aka hada da memory, kunsha na sel. rikodi / karanta shugaban. processor. Mene ne aiki manufa na wannan na'urar? Kai, ya samu da oda daga processor, ya rubuta cewa data ga cell ko ya karanta constants. A cikin sauki hali, wannan zai zama yawan ilmin lissafi. Bugu da ƙari, constants iya zama wani data tsarin da hali kirtani da sauransu. A karkashin gane m memory cell da bayanin da aka adana. A lokacin da kisa da algorithm daban-daban data za a iya rubuta a cikin irin wannan cell. A wannan manufa, na sirri kwakwalwa da kuma sauran lantarki. A algorithm yin wani aiki ne mai sa na dokokin domin karantawa ko rubuta bayanai a ƙwaƙwalwar cell.

iri-iri

Iri-iri ne wani irin fihirisa canji. A gaskiya ma, wani tarin Kwayoyin cewa raba na kowa nadi. Iri-iri bambanta biyu girma, uku-girma, da sauransu. D. The sauki daga wadannan ne mai yawan jere Kwayoyin. Irin wannan wani tsararru na da sunan. Kowane rabi na da yawan - index. Constant, adana a wani cell kira wani tsararru kashi.

Biyu-girma irin a wurinta abubuwa reminiscent na wani matrix. A Kwayoyin a cikin irin tsararru ne halin da biyu fihirisa (shi yayi kama da dara jirgin da ya ƙidaya Kwayoyin). A wannan manufa da aka aiwatar da mafi uku-girma tsarin.

Ƙirgar Algorithms

Wannan irin jerin flowcharts (misalai suna ba a wannan labarin) ne halin da yin daga farkon zuwa karshen zuwa ƙasa. A wannan yanayin, inji aikin wani wajabta aiki da shi daga mataki zuwa mataki. Kowane mataki ne abar kulawa da processor. Bayan sarrafa kwamfuta, ya umurni da write / karanta shugaban, inda kuma abin da ya rubuta da kuma yadda za a yi la'akari, idan ya cancanta. A karshe sakamakon da aka rubuta a cikin memory Kwayoyin, kowanne daga abin da ta index da kuma Stores ta m.

sashe Algorithms

A yi, a mikakke irin ne musamman rare. Shi ne sau da yawa zama dole shirya da jerin wanda, dangane da bai wa yanayi Saide bisa ga wani musamman reshe. A kashi qunshi da branched kashi type "bayani", ta hanyar abin da wani yanayin da aka bari, da kuma karin da mafi rassan a jerin.

Flowcharts: Misalan

Ka yi la'akari da yadda algorithm aiki branched. A matsayin misali, sama da aiki: z = y / x. Yana da aka gani daga yanayin da cewa yana da lissafi daya da ya rage mata - ba za a iya raba ta sifili. Don haka wajibi ne a kawar da shawararsu, da kuma sanar da mai amfani game da kuskure. Da farko kõma kashi. Yana zai kunshi bakwai tubalan. A farko hoto alama - "The Farko", na biyu - "Ku shiga" a nan ya kamata saita dabi'u na X kuma Y. Wannan ne bi da wani block "bayani", shi yana da za'ayi tabbaci na da yanayin X = 0. A wannan yanayin, inji daukawa fitar da wani sulhu da tantanin halitta m idan shigar da darajar za ta zo daidai da shi, sa'an nan da algorithm ke zuwa a yanke shawara reshe "I". A wannan yanayin, iko da aka canjawa wuri zuwa na hudu naúrar da na'ura jimloli wani "kuskure", da aikin ƙare a "End" bakwai alama. Idan sakamakon ne na musu, sa'an nan ta biyar hoto alama rarraba tsari aka yi da niyya darajar Z. A shida block fitarwa sakamakon a kan allo.

zagaye robin

Sau da yawa, na warware matsaloli da shi wajibi ne don ya mayar da kisan wani aiki a kan wannan dogara ga daban-daban dabi'u na canji da kuma samar da mahara nassi a kan wannan kashi na hanya. Irin wannan yankunan da ake kira hawan keke da algorithm - cyclical. Amfani da wannan Hanyar muhimmanci rage da jerin kanta. Cyclic Algorithms za a iya raba iri biyu: a gabãnin ba a sani ba, kuma sananne adadin irin wannan gaba wuce.

Misali mafita sashe algorithm

Ga wani misali a cikin abin da ba kashi a gabãnin tare da wani ba a sani ba yawan kafa. Don yin wannan, don magance matsalar - saka da ƙaramar yawan mambobi daga cikin jerin na halitta lambobi, da adadin abin da ya wuce da yawan K. Wannan block zane kunshi takwas haruffa. A farko, shigar da darajar K (№2). Sa'an nan, a cikin block 3 m R an saita zuwa "daya", yana nufin cewa za a fara kirgawa da na halitta lambobi. A tarawa adadin C a farkon an saita zuwa "sifili". Next, iko da aka canjawa wuri zuwa na biyar block, a cikinsa kisa da umurnin daukan wuri: C = C + P. Wato, da summation halayya C da P Kwayoyin, da kuma sakamakon da aka sake rubuta a C. Bayan Bugu da kari na farko kalma a cikin jerin aka bari №6 naúrar yanayi - idan Naira Miliyan Xari wuce qaddara yawan K? Idan yanayin ba gamsu, sa'an nan iko wuce zuwa hudu block, inda da m n an karu da daya, da kuma aiki ya ci gaba da sake don toshe №5. Wannan hanya za ta dauki wuri muddin wadannan yanayi ne gamsu: C> K, watau, tara adadin ya wuce wani qaddara darajar. The m n ne a kanta sake zagayowar. Next ci gaba da toshe №7, a cikinsa imprinted sakamakon.

Algorithms dauke da nested madauki tsarin

Sau da yawa da bukatar haifar da madauki da algorithmic maganin matsalar, wanda yana a cikin jiki a daban-daban sake zagayowar. An dauke da kullum. Irin wannan abubuwa suna kira nested madauki Tsarin. Su domin zai iya zama quite manyan. Aka ƙaddara ta a hanya wadda cinma da ake buƙata maganin matsalar. Alal misali, a cikin aiki da daya-girma tsararru, kamar yadda mai mulkin, gina wani kashi hawan keke ba tare da haše-haše. Duk da haka, a wasu lokuta, a warware irin wannan matsaloli shi wajibi ne don zaɓi wani version of kawai irin wannan hukunci. Ya kamata a lura cewa duk da nested madaukai, ciki har da na farko (m) ya dauke counters da sunaye daban-daban. Waje su za a iya amfani da a matsayin talakawa canji waje na ta sake zagayowar.

karin Algorithms

Wannan irin jerin ne wani analogue na harshe routines. A karin algorithm yana da wani sunan da a siga kira m. Sunan da aka ba bambanta shi da sauransu, da kuma da sigogi na rawa na fitarwa da kuma shigar da ilmin lissafi ayyuka. Suna zaba a hanyar da aka ƙãre cikakken sa na bukata yawa. Sau da yawa wanda kuma wannan m siga ne duka shigar da fitarwa. Alal misali, a cikin irin wannan algorithm za a iya amfani da shigar da tsararru ga aiki. A resultant part, shi za a iya gabatar a cikin modified tsari a matsayin wani fitarwa siga. Daga cikin iri karin Algorithms rarrabe tsakanin ayyuka da kuma hanyoyin.

bazuwar algorithm

Yana aka bayyana a matsayin fadada daga cikin janar makirci na algorithm a kan goyon bayan (ayyuka da kuma hanyoyin) da kuma shugaban. Wannan hanya mai sauki ne, a lokacin da algorithm aka bai wa block zane - na farko ware rabo daga gare shi, suna alhakin mafi yawan aiki. A mafi wuya, saukarwa ake yi a matsayin wani aiki da top-matakin hanyoyin. Bugu da ari, sun kasu kashi na farko yankunan low matakin. Yana da ma'aikata da manufa na "daga cikin hadaddun da sauki." Yana da aka gudanar muddin algorithm ba za a disassembled cikin ta sauki abubuwa. Yawancin lokaci da yanke shawara jerin bazuwar kunshi uku main saukarwa: data shigarwa, kasawa da wani tsararru, da fitarwa daga cikin An ware tsararru. A farko da kuma na karshe, saukarwa, saboda su kawai ba bukatar fadada, don haka suka yi a cikin babban algorithm. Amma na biyu ne mai matukar hadaddun kai-guntu lissafin, don haka shi ne yawanci nuna a raba block. kasawa, saukarwa, bi da bi, kasu kashi biyu: da bukatar kafa hanya (N-1) -fold na nassi daga wani qaddara tsararru da kuma gano da karami kashi a gutsure tsararru, bi da rearrangement to da farko rabo daga ta kashi. Tun da na karshe mataki an maimaita sau da yawa, shi ne rajista a matsayin mai raba hanya.