Exchange Sort and Selection Sort Algorithms: Comparison and Theoretical Analysis
DOI:
https://doi.org/10.30865/json.v7i2.9306Keywords:
algorithm; comparison; exchange sort; selection sort; swap; theoretical analysis.Abstract
The purpose of this study is to analyze the comparison of sorting algorithms. Searching algorithm is a main issue in computer science. Many algorithms have been presented by experts. The main issue is the efficiency of these algorithms. Sorting a large number of data will create time issues. Time needed to sort the data is very crucial in this context. Many sorting algorithms are in the field. Two of them are selection sort and exchange sort algorithms. These two are a popular algorithm in data structure. Exchange sort algorithm is very similar to Bubble Sort. Many say Bubble Sort is the same as Exchange Sort. The difference is in how it compares elements. Exchange sort compares one element to the other elements in the array and swaps elements if necessary. Selection sort algorithm is a combination of sorting and searching. For each process, comparison and theoretical analysis is given. The unsorted elements with the smallest or largest values are searched for and exchanged to their appropriate positions within the array. In the comparison and theoretical analysis 1, it was conducted by hand and we got the numbers to be descending from 11, 23, 30, 39, 41, 51 to be 51, 41, 39, 30, 23, 11. For the comparison and theoretical analysis 2, we got the numbers to be descending from 1, 22, 10, 9, 42, 26 to be 42, 26, 22, 10, 9, 1. The most swap happened in exchange sort of comparison and theoretical analysis 1 with 14 swaps, in the second exchange sort it is only 11 swaps. The research gap is about stages of processes algorithm with methodology systematic literature review. The stages of systematic literature review is presented which is planning, conducting literature search, and reporting. PRISMA flow chart is also presented. a visual representation of the article selection process. This diagram illustrates four main stages: Identification, Screening, Eligibility, Inclusion.
References
Y. Singh, M. Verma, I. Pandey, A. Saini, P. Chawla, and V. Niranjan, “Analysis and Comparison of Various Sorting Algorithms,” Tuijin Jishu/Journal Propuls. Technol., vol. 45, no. 2, pp. 5885–5890, 2024.
G. T. Heineman, G. Pollice, and S. Selkow, Algorithms in a Nutshell. 2025.
J. Erickson, Algorithms, 1st ed. Urbana: University of Illinois, 2019.
M. A. S. Ekowati, Z. P. Nindyatama, W. Widianto, and K. Dananti, “Comparative Analysis of the Speed of the Sorting Method on Google Translate Indonesian-English Using Binary Search,” Int. J. Glob. Oper. Res., vol. 3, no. 3, pp. 108–115, 2022, doi: 10.47194/ijgor.v3i3.167.
D. J. Mankowitz et al., “Faster sorting algorithms discovered using deep reinforcement learning,” Nature, vol. 618, no. 7964, pp. 257–263, 2023, doi: 10.1038/s41586-023-06004-9.
Q. Mehdi Rizvi, H. Rai, and R. Jaiswal, “Sorting Algorithms in Focus: A Critical Examination of Sorting Algorithm Performance,” Emerg. Trends IoT Comput. Technol., no. March, pp. 103–106, 2024, doi: 10.1201/9781003535423-19.
R. Purnomo and T. D. Putra, “Research and Analysis of Exchange Sort Algorithm in Data Structure,” Sink. J. dan Penelit. Tek. Inform., vol. 9, no. 4, pp. 1935–1941, 2025, doi: https://doi.org/10.33395/sinkron.v9i4.15005.
A. Zutshi and D. Goswami, “Systematic review and exploration of new avenues for sorting algorithm,” Int. J. Inf. Manag. Data Insights, vol. 1, no. 2, p. 100042, 2021, doi: 10.1016/j.jjimei.2021.100042.
Z. G. Zhu, “Analysis and Research of Sorting Algorithm in Data Structure Based on C Language,” J. Phys. Conf. Ser., vol. 1544, no. 1, 2020, doi: 10.1088/1742-6596/1544/1/012002.
R. Purnomo and T. D. Putra, “Theoretical Analysis of Standard Selection Sort Algorithm,” SinkrOn, vol. 8, no. 2, pp. 666–673, 2023, doi: 10.33395/sinkron.v8i2.12153.
A. M. Rabiu, E. J. Garba, B. Y. Baha, and M. I. Mukhtar, “Comparative Analysis between Selection Sort and Merge Sort Algorithms,” Niger. J. Basic Appl. Sci., vol. 29, no. 1, pp. 43–48, 2022, doi: 10.4314/njbas.v29i1.5.
Y. Chauhan and A. Duggal, “Different Sorting Algorithms comparison based upon the Time Complexity,” Int. J. Res. Anal. Rev., vol. 7, no. 3, pp. 114–121, 2020, [Online]. Available: www.ijrar.org
Pujiati, “Tahapan Systematic Literature Review & Contohnya,” deepublish. Accessed: Nov. 21, 2024. [Online]. Available: https://penerbitdeepublish.com/systematic-literature-review/
B. University, “Memahami Metode PRISMA dalam Systematic Literature Review (SLR),” School of Computer Science.
B. Ekmekci, C. E. McAnany, and C. Mura, “An Introduction to Programming for Bioscientists: A Python-Based Primer,” PLoS Comput. Biol., vol. 12, no. 6, 2016, doi: 10.1371/journal.pcbi.1004867.
K. Priambodo and J. Sasongko Wibowo, “Implementasi Algoritma Selection Sort Untuk Perangkingan Poin Pada E-Sports Tournament Garuda League,” no. 2020, pp. 978–979, 2021, [Online]. Available: www.garudaleague.com
M. R. Hanafi, M. A. Faadhilah, M. T. Dwi Putra, and D. Pradeka, “Comparison Analysis of Bubble Sort Algorithm with Tim Sort Algorithm Sorting Against the Amount of Data,” J. Comput. Eng. Electron. Inf. Technol., vol. 1, no. 1, pp. 29–38, 2022, doi: 10.17509/coelite.v1i1.43794.
A. Naz, H. Nawaz, A. Maitlo, and S. M. Hassan, “Implementation of Selection Sort Algorithm in Various Programming Languages,” Int. J. Adv. Trends Comput. Sci. Eng., vol. 10, no. 3, pp. 2371–2377, 2021, doi: 10.30534/ijatcse/2021/1231032021.
R. N. Vilchez, “Modified Selection Sort Algorithm Employing Boolean and Distinct Function in a Bidirectional Enhanced Selection Technique,” Int. J. Mach. Learn. Comput., vol. 10, no. 1, pp. 93–98, 2020, doi: 10.18178/ijmlc.2020.10.1.904.
S. Selvi, M. A. C. Evert, and B. Case, “Implementation of Effecient Sorting Algorithm in C/C++,” vol. 514, no. 3, pp. 34–40, 2021.
V. Paradigm, “Visual Paradigm Online,” Web Page. Accessed: Nov. 30, 2025. [Online]. Available: https://www.visual-paradigm.com/features/
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Jurnal Sistem Komputer dan Informatika (JSON)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
