Sorting Algorithms and Their Execution Times an Empirical Evaluation

Guillermo O. Pizarro-Vasquez, Fabiola Mejia Morales, Pierina Galvez Minervini, Miguel Botto-Tobar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationAdvances in Emerging Trends and Technologies - Proceedings of ICAETT 2020
EditorsLap-Kei Lee, Leong Hou U, Fu Lee Wang, Simon K. Cheung, Oliver Au, Kam Cheong Li
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages14
ISBN (Print)9783030636647
StatePublished - 2021
Event2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020 - Riobamba, Ecuador
Duration: 26 Oct 202030 Oct 2020

Publication series

NameAdvances in Intelligent Systems and Computing
ISSN (Print)2194-5357
ISSN (Electronic)2194-5365


Conference2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020

Bibliographical note

Publisher Copyright:
© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.


  • Execution time
  • Integrated development environment
  • Sorting
  • Sorting algorithms
  • Standard dataset


Dive into the research topics of 'Sorting Algorithms and Their Execution Times an Empirical Evaluation'. Together they form a unique fingerprint.

Cite this