Kimiyyar kwamfuta duk game da fahimtar hadaddun algorithms da tsarin bayanai.
Kuna da jerin abubuwan da ake buƙatar rarrabuwa, amma ba ku da lokaci ko albarkatu don amfani da ƙarin hadaddun rarrabuwa algorithm.
Rarraba shigarwa ɗaya ne daga cikin mafi sauƙin rarrabuwar algorithms, amma yana iya yin jinkiri ga manyan jeri.
Sauƙaƙan aiwatarwa da fahimta sun sanya wannan hanya ta zama abin fi so tsakanin masu shirye-shirye. Ya dace don ƙananan lissafin ko lokacin da kuke buƙatar mafita mai sauri.
A cikin wannan sakon bulogi, za mu duba rikitaccen lokaci na rarrabuwar abubuwa. Ana amfani da wannan algorithm don tsara tsararraki, kuma yana da lokacin aiki na O(n2). Wannan yana nufin cewa rikitarwa lokaci yana ƙaruwa tare da girman tsararru.
Duk da haka, wannan algorithm na iya zama da sauri sau da yawa fiye da sauran algorithms na rarrabuwa, kamar sauri-sort.
Bari mu kalli yadda rarrabuwar abubuwan sakawa ke aiki!
Menene Saka Tsarin Algorithm?
Abu ɗaya a lokaci guda, nau'in sakawa yana haifar da tsararrun tsararru, wanda akai-akai ana kiransa jeri.
Misali, ana amfani da rarrabuwar kawuna a cikin rikitattun shirye-shiryen kwamfuta kamar na’urar tattara bayanai, inda tsarin alamomi ke da muhimmanci ga fassarar shirin.
Ta Yaya Tsarin Saka Aiki yake?
Lokacin da muka yi amfani da nau'in sakawa don tsara tsararru, algorithm yana farawa ta hanyar nemo mafi ƙanƙanta abu a cikin jeri da saka shi cikin madaidaicin matsayi.
Daga nan sai ta nemo abu mafi ƙanƙanta na gaba kuma a saka shi cikin daidai matsayi, da sauransu.
Algorithm yana aiki ta hanyar madauki ta lissafin, kwatanta kowane abu da wanda ya zo gabansa.
Idan abubuwan suna cikin tsari mara kyau, algorithm yana musanya su. Daga nan sai ta bincika don ganin ko an jera lissafin, kuma idan haka ne, algorithm ɗin ya ƙare.
A aikace, nau'in sakawa galibi ana aiwatar da shi ta amfani da ƴan layukan lamba, yana mai da shi mashahurin zaɓi don rarrabuwar ƙananan tsararru. Duk da haka, ya kamata a yi la'akari da wahalar lokaci lokacin amfani da wannan algorithm.
Example:
Anan ga misalin yadda rarrabuwar abubuwan sakawa ke aiki. Za mu yi amfani da tsari mai zuwa:
1, 2, 3, 4, 5, 6
Algorithm yana farawa ne ta hanyar gano mafi ƙarancin abu a cikin jerin, wanda shine 1. Sannan ya sanya shi cikin daidai matsayi, matsayi na farko. Daga nan sai ya samo abu mafi ƙanƙanta na gaba, wanda shine 2. Yana sanya shi cikin daidai matsayi, wanda shine matsayi na biyu.
Daga nan sai ya nemo abu mafi karami na gaba, wato 3. Yana sanya shi a daidai matsayi, wato matsayi na uku.
Daga nan sai ya nemo abu mafi karami na gaba, wato 4. Yana sanya shi a daidai matsayi, wanda shine matsayi na hudu, da sauransu. An jera lissafin yanzu!
Zamu iya gani daga misalin cewa algorithm yana ɗaukar kwatancen guda shida da musanya don warware jerin. Wannan saboda yana ɗaukar n2 kwatancen da musanyawa don daidaita jerin abubuwan n. A wannan yanayin, n=6.
Yadda Ake Haɓaka Rukunin Tsara Tsakanin Lokaci?
Yayin da nau'in shigarwa yana da lokacin aiki na O(n2), ana iya inganta shi ta hanyar amfani da mafi kyawun rarrabuwa algorithm, kamar saurin rarrabuwa.
Quicksort yana da lokacin aiki na O (n log n), wanda ya fi O(n2).
Koyaya, a wasu lokuta, rarrabuwar sakawa na iya zama da sauri fiye da tsarawa.
Misali, idan lissafin ya rigaya yayi tsari, rarrabuwar shigar zai ɗauki ƙasa da lokaci fiye da daidaitawa.
A aikace, nau'in sakawa galibi ana aiwatar da shi ta amfani da ƴan layukan lamba, yana mai da shi mashahurin zaɓi don rarrabuwar ƙananan tsararru.
Duk da haka, ya kamata a yi la'akari da wahalar lokaci lokacin amfani da wannan algorithm.
Matsalolin Lokaci
Mafi Munin Halin Halin O(n2):
Rikicin lokaci yana ƙaruwa tare da girman tsararru. Yana daukan n2 kwatancen da musanyawa don daidaita jerin abubuwan n.
Misali, idan muna da tsararru na girman 1000, algorithm ɗin zai ɗauki kwatancen 1,000,000 da musanyawa don daidaita tsararrun.
Mafi Kyawun Halin O(n):
Matsalolin lokaci iri ɗaya ne da girman tsararrun shigarwar. I
t daukan n kwatance da musanya don warware jerin abubuwan n. Misali, la'akari da tsararru na girman 5. Algorithm ɗin zai ɗauki kwatance biyar da musanyawa don daidaita tsararrun.
Matsakaicin Haɗin Halin O(n2):
Matsakaicin lokaci yana tsakanin mafi munin kuma mafi kyawun rikitattun yanayi a cikin wannan yanayin.
Yana daukan n2 kwatancen da musanyawa don daidaita jerin abubuwan n.
Don haka, rarrabuwar shigar shine tsayayyen rarrabuwa algorithm.
Me yasa Shigar Yake Tsayawa?
Nau'in shigarwa yana da ƙarfi saboda yana adana tsari daidaitattun abubuwa a cikin tsararrun shigarwar.
Wannan yana da mahimmanci ga aikace-aikace da yawa, kamar dawo da bayanai ko nazarin kuɗi. Misali, idan muna da lissafin lambobi biyu kuma muna son kwatanta su, muna buƙatar tabbatar da cewa an kiyaye tsarin abubuwan.
Idan ba a jera lissafin ba, ba za mu kwatanta su daidai ba.
Leave a Reply