{"id":5496,"date":"2020-09-29T20:44:35","date_gmt":"2020-09-29T18:44:35","guid":{"rendered":"https:\/\/blue.pri.ee\/ttu\/?p=5496"},"modified":"2025-11-21T13:24:10","modified_gmt":"2025-11-21T11:24:10","slug":"7-labor-sorteerimine","status":"publish","type":"post","link":"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/","title":{"rendered":"PR1ET7: sorteerimine"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_85 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Praktikumi_materjal\" >Praktikumi materjal<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Esitamisele_kuuluvad_ulesanded\" >Esitamisele kuuluvad \u00fclesanded<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Tunnitoo_W07-1_Mullsorteerimine\" >Tunnit\u00f6\u00f6 [W07-1]: Mullsorteerimine<\/a><ul class='ez-toc-list-level-5' ><li class='ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Nouded\" >N\u00f5uded<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Lahenduses_noutavad_funktsioonid\" >Lahenduses n\u00f5utavad funktsioonid<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Vihjed\" >Vihjed<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Test_1_Tagurpidine_jarjestus\" >Test 1: Tagurpidine j\u00e4rjestus<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Test_2_Juhuslik_massiiv\" >Test 2: Juhuslik massiiv<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Lisaulesanne_1_W07-2_Tsuklite_taiendav_optimeerimine\" >Lisa\u00fclesanne 1 [W07-2]: Ts\u00fcklite t\u00e4iendav optimeerimine<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-10\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Lisaulesanne_2_W7-03_Maatriksi_sorteerimine\" >Lisa\u00fclesanne 2 [W7-03]: Maatriksi sorteerimine<\/a><ul class='ez-toc-list-level-5' ><li class='ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-11\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Oodatav_tulemus\" >Oodatav tulemus<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-5'><a class=\"ez-toc-link ez-toc-heading-12\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Vihjeid\" >Vihjeid<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-13\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Parast_tundi_peaksid_oskama_jargmist\" >P\u00e4rast tundi peaksid oskama j\u00e4rgmist<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-14\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Taiendav_materjal\" >T\u00e4iendav materjal<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-15\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Uldised_viited\" >\u00dcldised viited<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-16\" href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/#Taisarvude_uletaitumine_reaalses_elus\" >T\u00e4isarvude \u00fclet\u00e4itumine reaalses elus<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h3><span class=\"ez-toc-section\" id=\"Praktikumi_materjal\"><\/span><strong>Praktikumi materjal<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<ul>\n<li>Slaidid: <a href=\"https:\/\/blue.pri.ee\/ttu\/files\/iax0583\/slaidid-et\/07_arvusysteemid.pdf\"><strong>Arvus\u00fcsteemid<\/strong><\/a><\/li>\n<li>Slaidid: <a href=\"https:\/\/blue.pri.ee\/ttu\/files\/iax0583\/slaidid-et\/07_Sorteerimine.pdf\"><strong>Sorteerimine<\/strong><\/a><\/li>\n<li>Algoritm: <strong><a href=\"https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/algoritmide-ulesanded\/#Algoritm_6_Vahima_arvu_aluse_leidmine\">https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/algoritmide-ulesanded\/#Algoritm_6_Vahima_arvu_aluse_leidmine<\/a><\/strong><\/li>\n<\/ul>\n<h3><span class=\"ez-toc-section\" id=\"Esitamisele_kuuluvad_ulesanded\"><\/span>Esitamisele kuuluvad \u00fclesanded<span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p>Selles tunnis on \u00fcks tunnit\u00f6\u00f6, millele on v\u00e4lja pakutud kaks lisa\u00fclesannet.<\/p>\n<h4><span class=\"ez-toc-section\" id=\"Tunnitoo_W07-1_Mullsorteerimine\"><\/span>Tunnit\u00f6\u00f6 [W07-1]: Mullsorteerimine<span class=\"ez-toc-section-end\"><\/span><\/h4>\n<p>Tunnit\u00f6\u00f6 raames sorteerid kasutaja poolt sisestatud arvujada kasutades mullsorteerimise algoritmi.<\/p>\n<h5><span class=\"ez-toc-section\" id=\"Nouded\"><\/span>N\u00f5uded<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<ul>\n<li>Kasutajalt k\u00fcsitakse 5 t\u00e4isarvu, mis salvestatakse massiivi<\/li>\n<li>Sorteeri massiiv kasutades mullsorteerimise algoritmi<\/li>\n<li>Optimeeri ts\u00fcklite kestvust sedasi, et asjatult v\u00f5rdlusi ei sooritataks &#8211; just nii nagu oli slaidil n\u00e4idatud. Veendu, etoptimeerid nii sisemise kui ka v\u00e4limise ts\u00fckli piire!<\/li>\n<li>Loenda ja kuva, mitu korda arve v\u00f5rreldi omavahel. <strong>Kui tegid optimeerimise korrektselt, peaksid saama t\u00e4pselt 10 v\u00f5rdlust.<\/strong><\/li>\n<li>Kuva massiiv kasvavas j\u00e4rjekorras<\/li>\n<li>Kuva massiiv kahanevas j\u00e4rjekorras<\/li>\n<li>Kogu programmi v\u00e4ltel tohid sorteerida vaid \u00fche korra<\/li>\n<li>Luua tuleb neli funktsiooni. Loetelu n\u00f5utud funktsioonidest on loetletud allpool<\/li>\n<li>Meeldetuletuseks!\n<ul>\n<li>Muutujad <span class=\"lang:default highlight:0 decode:true crayon-inline\">lowerCamelCase<\/span><\/li>\n<li>Funktsioonid <span class=\"lang:default highlight:0 decode:true crayon-inline \">UpperCamelCase<\/span><\/li>\n<li>Makrod <span class=\"lang:default highlight:0 decode:true crayon-inline\">SCREAMING_SNAKE_CASE<\/span><\/li>\n<li>Maagilised numbrid koodist asendatud makrotega<\/li>\n<li>Massiivi pikkus antakse funktsiooni alati kaasa<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p><strong>Vasta k\u00fcsimusele<\/strong>: j\u00e4lgida saab nii v\u00f5rdluste kui vahetuste arvu. Kumb neist meie optimeeringu tulemusel v\u00e4heneb, kumb j\u00e4\u00e4b samaks?<\/p>\n<h5><span class=\"ez-toc-section\" id=\"Lahenduses_noutavad_funktsioonid\"><\/span>Lahenduses n\u00f5utavad funktsioonid<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<p>Selles programmis tuleb sul kokku luua 4 funktsiooni<\/p>\n<ul>\n<li>Numbrite lugemiseks massiivi<\/li>\n<li>Massiivi sorteerimiseks<\/li>\n<li>Kaks funktsiooni massiivi kuvamiseks<\/li>\n<\/ul>\n<h5><span class=\"ez-toc-section\" id=\"Vihjed\"><\/span>Vihjed<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<ul>\n<li>Saad soovi korral korduvkasutada juba m\u00f5nda eelenvatel n\u00e4dalatel koostatud funktsiooni<\/li>\n<li>Mullsorteerimise funktsioon on j\u00e4rjekordne funktsioon, mille peaksid oma varasalve panema. Kui funktsiooni endale talletad, v\u00f5ta sealt vahetuste loendamine \u00e4ra &#8211; mida v\u00e4hem k\u00f5rvalm\u00f5jusid funktsioonidel on seda parem.<\/li>\n<\/ul>\n<h5><span class=\"ez-toc-section\" id=\"Test_1_Tagurpidine_jarjestus\"><\/span>Test 1: Tagurpidine j\u00e4rjestus<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<p>Tegu on k\u00f5ige keerulisema juhuga mullsorteerimiseks. Suurim arv on esimene, v\u00e4him viimane.<\/p>\n<pre class=\"theme:cisco-router toolbar:1 nums:false lang:default highlight:0 decode:true\" title=\"Sample: sort\">This program takes 5 numbers from the user and sorts them. Output is given in both ascending and descending order.\r\n\r\nEnter number 1 \/ 5: 5\r\nEnter number 2 \/ 5: 4\r\nEnter number 3 \/ 5: 3\r\nEnter number 4 \/ 5: 2\r\nEnter number 5 \/ 5: 1\r\n\r\nComparisons made during sorting: 10\r\n\r\nNumbers in ascending order: 1 2 3 4 5\r\nNumbers in descending order: 5 4 3 2 1<\/pre>\n<h5><span class=\"ez-toc-section\" id=\"Test_2_Juhuslik_massiiv\"><\/span>Test 2: Juhuslik massiiv<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<p>Juhuslik j\u00e4rjekord. V\u00f5rdluste arv j\u00e4\u00e4b samaks. Testib ka kitsaid piirjuhte osadel arvutis\u00fcsteemidel, kui massiivi piirest \u00fcle minnakse. Tegu ei ole garanteeritud tulemust andva testiga (selleks on spetsiaalsed t\u00f6\u00f6riistad), aga v\u00f5ib m\u00f5nel juhul vea n\u00e4htavaks tuua.<\/p>\n<pre class=\"theme:cisco-router toolbar:1 nums:false lang:default highlight:0 decode:true\" title=\"Sample: sort\">This program takes 5 numbers from the user and sorts them. Output is given in both ascending and descending order.\r\n\r\nEnter number 1 \/ 5: -5\r\nEnter number 2 \/ 5: 3\r\nEnter number 3 \/ 5: 9\r\nEnter number 4 \/ 5: 2\r\nEnter number 5 \/ 5: -5\r\n\r\nComparisons made during sorting: 10\r\n\r\nNumbers in ascending order: -5 -5 2 3 9\r\nNumbers in descending order: 9 3 2 -5 -5<\/pre>\n<h4><span class=\"ez-toc-section\" id=\"Lisaulesanne_1_W07-2_Tsuklite_taiendav_optimeerimine\"><\/span>Lisa\u00fclesanne 1 [W07-2]: Ts\u00fcklite t\u00e4iendav optimeerimine<span class=\"ez-toc-section-end\"><\/span><\/h4>\n<p>Algselt kirjeldatud algoritmi \u00fcks puudustest on olukord, kui massiiv saab oluliselt varem sorteeritud, kui algoritmi t\u00e4ielik t\u00f6\u00f6aeg ette n\u00e4eb. Sellist olukorda on v\u00f5imalik tuvastada ning \u00e4ra kasutada.<\/p>\n<ul>\n<li>Kui massiiv saab sorteerituks enne viimast v\u00e4limise ts\u00fckli l\u00e4bik\u00e4iku, peata sorteerimine. V\u00e4ldi t\u00fchja t\u00f6\u00f6 tegemist.<\/li>\n<li>Vihjeks: m\u00f5tle, millised tegevused tehakse sorteerimise k\u00e4igus ning mida ei tehta arvude puhul, mis on juba sorteeritud.<\/li>\n<li>Kaitsmisel: Selgita, milliste sisendandmete puhul optimeeritud algoritm parema tulemuse annab, ning t\u00f5esta seda oma tulemusega.<\/li>\n<\/ul>\n<h4><span class=\"ez-toc-section\" id=\"Lisaulesanne_2_W7-03_Maatriksi_sorteerimine\"><\/span>Lisa\u00fclesanne 2 [W7-03]: Maatriksi sorteerimine<span class=\"ez-toc-section-end\"><\/span><\/h4>\n<p>Selles \u00fclesandes h\u00fcppad veidike teemades ette ning pead omap\u00e4i tutvuma 2-m\u00f5\u00f5tmelise massiivi ehk maatriksiga.<\/p>\n<ul>\n<li>Lahenda \u00fclesanne eraldi programmina, kasutades varasemalt tehtut p\u00f5hjana. J\u00e4ta algne lahendus alles! Varem tehtud funktsioonid kuluvad tulevikus \u00e4ra!<\/li>\n<li>Antud lisa\u00fclesande v\u00f5id lahendada funktsioonideta, kuna me pole veel maatriksi edastamisest funktsioonidesse r\u00e4\u00e4kinud.<\/li>\n<li>Massiivi asemel tuleb sorteerida 5 x 5 maatriks<\/li>\n<li>Sorteerimine toimub rida-rea haaval.<\/li>\n<li>Maatriks peab olema algv\u00e4\u00e4rtustatud. Kasuta j\u00e4rgnevat maatriksit testimiseks\n<pre class=\"toolbar:1 lang:c decode:true\" title=\"matrix init\">#define LEN 5\r\n\r\nint main(void)\r\n{\r\n    int numbers[LEN][LEN] = {{1, 2, 3, 4, 5},\r\n                             {5, 4, 3, 2, 1},\r\n                             {-10, -25, -5, -105, -44},\r\n                             {-3, 3, -3, 3, -3},\r\n                             {0, 0, 0, 0, 0}};\r\n    return 0;\r\n}\r\n<\/pre>\n<\/li>\n<li>N\u00e4ite maatriksi v\u00e4ljatr\u00fckist ja ts\u00fcklitest leiad siit: <strong><a href=\"https:\/\/blue.pri.ee\/ttu\/koodimisjuhendid\/muutujate-deklareerimine-ja-algvaartustamine\/\">https:\/\/blue.pri.ee\/ttu\/koodimisjuhendid\/muutujate-deklareerimine-ja-algvaartustamine\/<\/a><\/strong><\/li>\n<\/ul>\n<h5><span class=\"ez-toc-section\" id=\"Oodatav_tulemus\"><\/span>Oodatav tulemus<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<pre class=\"toolbar:2 nums:false lang:default highlight:0 decode:true\" title=\"Sorted matrix\">   1    2    3    4    5\r\n   1    2    3    4    5\r\n-105  -44  -25  -10   -5  \r\n  -3   -3   -3    3    3\r\n   0    0    0    0    0<\/pre>\n<h5><span class=\"ez-toc-section\" id=\"Vihjeid\"><\/span>Vihjeid<span class=\"ez-toc-section-end\"><\/span><\/h5>\n<ul>\n<li>Soovid oma juba loodud mullsorteerimise funktsiooni \u00e4ra kasutada? C keeles on v\u00f5imalik edastada funktsiooni maatriks &#8220;rea-kaupa&#8221; (tegelikkus on veidi keerulisem, aga t\u00e4idab meie eesm\u00e4rki). Selleks kutsu funktsioon nii:<br \/>\n<span class=\"lang:c decode:true crayon-inline \">SortArray(numbers[rowIndex], rowLength);<\/span><br \/>\nSedasi n\u00e4eb su kood oluliselt ilusam v\u00e4lja.<\/li>\n<\/ul>\n<h3><span class=\"ez-toc-section\" id=\"Parast_tundi_peaksid_oskama_jargmist\"><\/span><strong>P\u00e4rast tundi peaksid oskama j\u00e4rgmist<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<ul>\n<li>Peaksid saama aru, mis on arvu alus<\/li>\n<li>Peaksid teadma enimlevinuid arvus\u00fcsteeme, muuhulgas kahend- ja 16nds\u00fcsteemi.<\/li>\n<li>Peaksid aru saama, mis vahe on positsioonilisel ja mittepositsioonilisel arvus\u00fcsteemil.<\/li>\n<li>Peaksid aru saama, mis asi on bitt ja bait ning mitu bitti on baidis.<\/li>\n<li>Peaksid oskama teisendusi arvus\u00fcsteemides (10 -&gt; 2, 10 -&gt; 16, 10 -&gt; 8, 2 -&gt; 10, 2 -&gt; 16, 16 -&gt; 10, 16 -&gt; 2, 8 -&gt; 10)<\/li>\n<li>Peaksid aru saama, mis asi on t\u00e4isarvu \u00fclet\u00e4itumine<\/li>\n<li>Peaksid m\u00f5istma, et sorteerimiseks on v\u00e4ga suur hulk algoritme ning \u00f5ige algoritmi valimine on olulise t\u00e4htsusega reaalsetes rakendustes.<\/li>\n<li>Peaksid m\u00f5istma, et optimeerimisel ja v\u00f5imsamal riistvaral on oma koht, kuid parem algoritm v\u00f5i l\u00e4henemine annab suurema v\u00f5idu.<\/li>\n<li>Peaksid aru saama, kuidas mullsort t\u00f6\u00f6tab ning oskama seda oma rakendustes kasutada.<\/li>\n<\/ul>\n<h3><span class=\"ez-toc-section\" id=\"Taiendav_materjal\"><\/span><strong>T\u00e4iendav materjal<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<h4><span class=\"ez-toc-section\" id=\"Uldised_viited\"><\/span><strong>\u00dcldised viited<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<ul>\n<li>Khan Academy: Binary and hexadecimal number systems<br \/>\n<a href=\"https:\/\/www.khanacademy.org\/math\/algebra-home\/alg-intro-to-algebra\/algebra-alternate-number-bases\/v\/number-systems-introduction\">https:\/\/www.khanacademy.org\/math\/algebra-home\/alg-intro-to-algebra\/algebra-alternate-number-bases\/v\/number-systems-introduction<\/a><\/li>\n<li>Sorting algorithms animations (compare speed, different input data, algorithms)<br \/>\n<a href=\"https:\/\/www.toptal.com\/developers\/sorting-algorithms\">https:\/\/www.toptal.com\/developers\/sorting-algorithms<\/a><\/li>\n<li>15 and Hexadecimal &#8211; Numberphile<br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=9xbJ3enqLnA\">https:\/\/www.youtube.com\/watch?v=9xbJ3enqLnA<\/a><\/li>\n<li>Binary Addition &amp; Overflow &#8211; Computerphile<br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=WN8i5cwjkSE\">https:\/\/www.youtube.com\/watch?v=WN8i5cwjkSE<\/a><\/li>\n<li>Base Number Jokes Explained &#8211; Numberphile<br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=Fmb3TCvlETk\">https:\/\/www.youtube.com\/watch?v=Fmb3TCvlETk<\/a><\/li>\n<li>Integer Overflow<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Integer_overflow\">https:\/\/en.wikipedia.org\/wiki\/Integer_overflow<\/a><\/li>\n<li>Positional notation<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Positional_notation\">https:\/\/en.wikipedia.org\/wiki\/Positional_notation<\/a><\/li>\n<li>Sorting Algorithms<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Sorting_algorithm\">https:\/\/en.wikipedia.org\/wiki\/Sorting_algorithm<\/a><\/li>\n<li>Bubble sort<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Bubble_sort\">https:\/\/en.wikipedia.org\/wiki\/Bubble_sort<\/a><\/li>\n<li>Radix<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Radix\">https:\/\/en.wikipedia.org\/wiki\/Radix<\/a><\/li>\n<\/ul>\n<h4><span class=\"ez-toc-section\" id=\"Taisarvude_uletaitumine_reaalses_elus\"><\/span><strong>T\u00e4isarvude \u00fclet\u00e4itumine reaalses elus<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n<ul>\n<li>Chrome and Firefox Are So Old They Might \u201cBreak\u201d the Internet<br \/>\n<a href=\"https:\/\/www.reviewgeek.com\/110211\/chrome-and-firefox-are-so-old-they-might-break-the-internet\/\">https:\/\/www.reviewgeek.com\/110211\/chrome-and-firefox-are-so-old-they-might-break-the-internet\/<\/a><br \/>\nSeotud viide: <a href=\"https:\/\/maqentaer.com\/devopera-static-backup\/http\/dev.opera.com\/articles\/view\/opera-ua-string-changes\/index.html\">https:\/\/maqentaer.com\/devopera-static-backup\/http\/dev.opera.com\/articles\/view\/opera-ua-string-changes\/index.html<\/a><\/li>\n<li>Older Honda and Acura models hit by Y2K22 bug that resets clocks 20 years in the past<br \/>\n<a href=\"https:\/\/www.theverge.com\/2022\/1\/8\/22873403\/honda-acuras-y2k22-bug-clocks-reset-2002\">https:\/\/www.theverge.com\/2022\/1\/8\/22873403\/honda-acuras-y2k22-bug-clocks-reset-2002<\/a><\/li>\n<li>Integer overflow in GPS:<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/GPS_Week_Number_Rollover\">https:\/\/en.wikipedia.org\/wiki\/GPS_Week_Number_Rollover<\/a><\/li>\n<li>Gangnam Style overflows INT_MAX, forces YouTube to go 64-bit<br \/>\n<a href=\"https:\/\/arstechnica.com\/information-technology\/2014\/12\/gangnam-style-overflows-int_max-forces-youtube-to-go-64-bit\/\">https:\/\/arstechnica.com\/information-technology\/2014\/12\/gangnam-style-overflows-int_max-forces-youtube-to-go-64-bit\/<\/a><\/li>\n<li>Computerphile &#8211; How Gangnam Style Broke<br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=vA0Rl6Ne5C8\">https:\/\/www.youtube.com\/watch?v=vA0Rl6Ne5C8<\/a><\/li>\n<li>Overflow in the stock market: <a href=\"https:\/\/www.theregister.com\/2021\/05\/07\/bug_warren_buffett_rollover_nasdaq\/\">https:\/\/www.theregister.com\/2021\/05\/07\/bug_warren_buffett_rollover_nasdaq\/<\/a><\/li>\n<li>Integer overflow in calendars (Y2K):<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Year_2000_problem\">https:\/\/en.wikipedia.org\/wiki\/Year_2000_problem<\/a><\/li>\n<li>Nuclear Gandhi:<br \/>\n<a href=\"https:\/\/en.wikipedia.org\/wiki\/Nuclear_Gandhi\">https:\/\/en.wikipedia.org\/wiki\/Nuclear_Gandhi<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Praktikumi materjal Slaidid: Arvus\u00fcsteemid Slaidid: Sorteerimine Algoritm: https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/algoritmide-ulesanded\/#Algoritm_6_Vahima_arvu_aluse_leidmine Esitamisele kuuluvad \u00fclesanded Selles tunnis on \u00fcks tunnit\u00f6\u00f6, millele on v\u00e4lja pakutud kaks lisa\u00fclesannet. Tunnit\u00f6\u00f6 [W07-1]: Mullsorteerimine Tunnit\u00f6\u00f6 raames sorteerid kasutaja poolt sisestatud arvujada kasutades mullsorteerimise algoritmi. N\u00f5uded Kasutajalt k\u00fcsitakse 5 t\u00e4isarvu, mis salvestatakse massiivi Sorteeri massiiv kasutades mullsorteerimise algoritmi Optimeeri ts\u00fcklite kestvust sedasi, et asjatult v\u00f5rdlusi &hellip; <a href=\"https:\/\/blue.pri.ee\/ttu\/laborid\/pr1-et\/7-labor-sorteerimine\/\" class=\"more-link\">Loe edasi <span class=\"screen-reader-text\">PR1ET7: sorteerimine<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[97,94],"tags":[],"class_list":["post-5496","post","type-post","status-publish","format-standard","hentry","category-laborid","category-pr1-et"],"_links":{"self":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/posts\/5496","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/comments?post=5496"}],"version-history":[{"count":12,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/posts\/5496\/revisions"}],"predecessor-version":[{"id":10917,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/posts\/5496\/revisions\/10917"}],"wp:attachment":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/media?parent=5496"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/categories?post=5496"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/tags?post=5496"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}