Sorting Algorithms and Their Execution Times an Empirical Evaluation

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

doi:10.1007/978-3-030-63665-4_27

Sorting Algorithms and Their Execution Times an Empirical Evaluation

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

Software Engineering and Knowledge Engineering Research Group (GIISIC)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 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 language	English
Title of host publication	Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020
Editors	Lap-Kei Lee, Leong Hou U, Fu Lee Wang, Simon K. Cheung, Oliver Au, Kam Cheong Li
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	335-348
Number of pages	14
ISBN (Print)	9783030636647
DOIs	https://doi.org/10.1007/978-3-030-63665-4_27
State	Published - 2021
Event	2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020 - Riobamba, Ecuador Duration: 26 Oct 2020 → 30 Oct 2020

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	1302
ISSN (Print)	2194-5357
ISSN (Electronic)	2194-5365

Conference

Conference	2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020
Country/Territory	Ecuador
City	Riobamba
Period	26/10/20 → 30/10/20

Bibliographical note

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

Keywords

Execution time
Integrated development environment
Sorting
Sorting algorithms
Standard dataset

Access to Document

10.1007/978-3-030-63665-4_27

Cite this

Pizarro-Vasquez, G. O., Mejia Morales, F., Galvez Minervini, P., & Botto-Tobar, M. (2021). Sorting Algorithms and Their Execution Times an Empirical Evaluation. In L.-K. Lee, L. H. U, F. L. Wang, S. K. Cheung, O. Au, & K. C. Li (Eds.), Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020 (pp. 335-348). (Advances in Intelligent Systems and Computing; Vol. 1302). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-63665-4_27

Pizarro-Vasquez, Guillermo O. ; Mejia Morales, Fabiola ; Galvez Minervini, Pierina et al. / Sorting Algorithms and Their Execution Times an Empirical Evaluation. Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020. editor / Lap-Kei Lee ; Leong Hou U ; Fu Lee Wang ; Simon K. Cheung ; Oliver Au ; Kam Cheong Li. Springer Science and Business Media Deutschland GmbH, 2021. pp. 335-348 (Advances in Intelligent Systems and Computing).

@inproceedings{d9ed52e0a61b4af68dc8ace9638b2937,

title = "Sorting Algorithms and Their Execution Times an Empirical Evaluation",

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 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.",

keywords = "Execution time, Integrated development environment, Sorting, Sorting algorithms, Standard dataset",

author = "Pizarro-Vasquez, {Guillermo O.} and {Mejia Morales}, Fabiola and {Galvez Minervini}, Pierina and Miguel Botto-Tobar",

note = "Publisher Copyright: {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020 ; Conference date: 26-10-2020 Through 30-10-2020",

year = "2021",

doi = "10.1007/978-3-030-63665-4_27",

language = "English",

isbn = "9783030636647",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "335--348",

editor = "Lap-Kei Lee and U, {Leong Hou} and Wang, {Fu Lee} and Cheung, {Simon K.} and Oliver Au and Li, {Kam Cheong}",

booktitle = "Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020",

address = "Germany",

}

Pizarro-Vasquez, GO, Mejia Morales, F, Galvez Minervini, P & Botto-Tobar, M 2021, Sorting Algorithms and Their Execution Times an Empirical Evaluation. in L-K Lee, LH U, FL Wang, SK Cheung, O Au & KC Li (eds), Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020. Advances in Intelligent Systems and Computing, vol. 1302, Springer Science and Business Media Deutschland GmbH, pp. 335-348, 2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020, Riobamba, Ecuador, 26/10/20. https://doi.org/10.1007/978-3-030-63665-4_27

Sorting Algorithms and Their Execution Times an Empirical Evaluation. / Pizarro-Vasquez, Guillermo O.; Mejia Morales, Fabiola; Galvez Minervini, Pierina et al.
Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020. ed. / Lap-Kei Lee; Leong Hou U; Fu Lee Wang; Simon K. Cheung; Oliver Au; Kam Cheong Li. Springer Science and Business Media Deutschland GmbH, 2021. p. 335-348 (Advances in Intelligent Systems and Computing; Vol. 1302).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Sorting Algorithms and Their Execution Times an Empirical Evaluation

AU - Pizarro-Vasquez, Guillermo O.

AU - Mejia Morales, Fabiola

AU - Galvez Minervini, Pierina

AU - Botto-Tobar, Miguel

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

KW - Execution time

KW - Integrated development environment

KW - Sorting

KW - Sorting algorithms

KW - Standard dataset

UR - http://www.scopus.com/inward/record.url?scp=85098273829&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-63665-4_27

DO - 10.1007/978-3-030-63665-4_27

M3 - Conference contribution

AN - SCOPUS:85098273829

SN - 9783030636647

T3 - Advances in Intelligent Systems and Computing

SP - 335

EP - 348

BT - Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020

A2 - Lee, Lap-Kei

A2 - U, Leong Hou

A2 - Wang, Fu Lee

A2 - Cheung, Simon K.

A2 - Au, Oliver

A2 - Li, Kam Cheong

PB - Springer Science and Business Media Deutschland GmbH

T2 - 2nd International Conference on Advances in Emerging Trends and Technologies, ICAETT 2020

Y2 - 26 October 2020 through 30 October 2020

ER -

Pizarro-Vasquez GO, Mejia Morales F, Galvez Minervini P, Botto-Tobar M. Sorting Algorithms and Their Execution Times an Empirical Evaluation. In Lee LK, U LH, Wang FL, Cheung SK, Au O, Li KC, editors, Advances in Emerging Trends and Technologies - Proceedings of ICAETT 2020. Springer Science and Business Media Deutschland GmbH. 2021. p. 335-348. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-030-63665-4_27

Sorting Algorithms and Their Execution Times an Empirical Evaluation

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this