http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Pizarro-Vasquez_et_al_2020aPizarro-Vasquez et al 2020a - Revision history2026-06-10T22:54:16ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Pizarro-Vasquez_et_al_2020a&diff=235048&oldid=prevMbotto: Mbotto moved page Draft Botto Tobar 544550547 to Pizarro-Vasquez et al 2020a2022-01-20T13:52:05Z<p>Mbotto moved page <a href="/public/Draft_Botto_Tobar_544550547" class="mw-redirect" title="Draft Botto Tobar 544550547">Draft Botto Tobar 544550547</a> to <a href="/public/Pizarro-Vasquez_et_al_2020a" title="Pizarro-Vasquez et al 2020a">Pizarro-Vasquez et al 2020a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 13:52, 20 January 2022</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Mbottohttp://www.colloquiam.com/wd/index.php?title=Pizarro-Vasquez_et_al_2020a&diff=235047&oldid=prevMbotto: Created page with " == Abstract == One of the main topics in computer science is how to perform data classification without requiring plenty of resources and time. The sorting algorithms Quicks..."2022-01-20T13:52:04Z<p>Created page with " == Abstract == One of the main topics in computer science is how to perform data classification without requiring plenty of resources and time. The sorting algorithms Quicks..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
One of the main topics in computer science is how to perform data classification without requiring plenty of resources and time. The sorting algorithms Quicksort, Mergesort, Timsort, Heapsort, Bubblesort, Insertion Sort, Selection Sort, Tree Sort, Shell Sort, Radix Sort, Counting Sort, are the most recognized and used. The existence of different sorting algorithm options led us to ask: What is the algorithm that us better execution times? Under this context, it was necessary to understand the various sorting algorithms in C and Python programming language to evaluate them and determine which one has the shortest execution time. We implement algorithms that help create four types of integer arrays (random, almost ordered, inverted, and few unique). We implement eleven classification algorithms to record each execution time, using different elements and iterations to verify the accuracy. We carry out the research using the integrated development environments Dev-C++ 5.11 and Sublime Text 3. The products allow us to identify different situations in which each algorithm shows better execution times.<br />
<br />
== Full document ==<br />
<pdf>Media:Draft_Botto Tobar_544550547-6488-document.pdf</pdf></div>Mbotto