Research and Analysis of Exchange Sort Algorithm in Data Structure
DOI:
10.33395/sinkron.v9i4.15005Keywords:
ascending, descending, exchange sort, pivot, swapAbstract
Exchange sort is different from bubble sort. Exchange sort compares an element with other elements in the array, and swaps elements if necessary. So there is an element that is always the center element (pivot). Here is its theoretical description: Comparison, the algorithm compares each element with its adjacent element. Then continue until all elements are compared. Swap: If the elements are in the wrong order (for example, in ascending order, if the left element is greater than the right), they are swapped. This swapping continues until all match numbers are swapped. Iteration, this process of comparing and swapping, is repeated for each pair of adjacent elements in the array. Looping, this process is repeated a number of times (traversing) the array until no more swapping is required, indicating that the array is sorted. It is concluded that for the six numbers in these three case studies, the iterations needed are 5 iterations each. The swaps counts needed are 7, for case study 1. The swap counts needed are 12 for case study 2 and the swap counts are 8 for case study 3. In this research and analysis, the order, all of them is descending, although it can be made ascending. In modern days, exchange sort plays a very important role in terms of sorting algorithms. This paper is only research and analysis. For novelty, the analysis is given with a clear step-by-step procedure of the algorithm.
Downloads
References
Alotaibi, A., Almutairi, A., & Kurdi, H. (2020). OneByone (OBO): A fast sorting algorithm. Procedia Computer Science, 175, 270–277. https://doi.org/10.1016/j.procs.2020.07.040
Chauhan, Y., & Duggal, A. (2020). Different Sorting Algorithms comparison based upon the Time Complexity. International Journal of Research and Analytical Reviews, 7(3), 114–121. www.ijrar.org
Cherukuri Nischay Sai. (2021). A Comprehensive Study of Various Sorting Algorithms. International Journal of Science and Research (IJSR, 10(11), 1044–1052.
Ekowati, M. A. S., Nindyatama, Z. P., Widianto, W., & Dananti, K. (2022). Comparative Analysis of the Speed of the Sorting Method on Google Translate Indonesian-English Using Binary Search. International Journal of Global Operations Research, 3(3), 108–115. https://doi.org/10.47194/ijgor.v3i3.167
Gill, S. K., Singh, V. P., Sharma, P., & Kumar, D. (2018). A Comparative Study of Various Sorting Algorithms. International Journal of Advanced Research in Computer Science, 4, 366–372.
Hanafi, M. R., Faadhilah, M. A., Dwi Putra, M. T., & Pradeka, D. (2022). Comparison Analysis of Bubble Sort Algorithm with Tim Sort Algorithm Sorting Against the Amount of Data. Journal of Computer Engineering, Electronics and Information Technology, 1(1), 29–38. https://doi.org/10.17509/coelite.v1i1.43794
Mankowitz, D. J., Michi, A., Zhernov, A., Gelmi, M., Selvi, M., Paduraru, C., Leurent, E., Iqbal, S., Lespiau, J. B., Ahern, A., Köppe, T., Millikin, K., Gaffney, S., Elster, S., Broshear, J., Gamble, C., Milan, K., Tung, R., Hwang, M., … Silver, D. (2023). Faster sorting algorithms discovered using deep reinforcement learning. Nature, 618(7964), 257–263. https://doi.org/10.1038/s41586-023-06004-9
Mehdi Rizvi, Q., Rai, H., & Jaiswal, R. (2024). Sorting Algorithms in Focus: A Critical Examination of Sorting Algorithm Performance. Emerging Trends in IoT and Computing Technologies, March, 103–106. https://doi.org/10.1201/9781003535423-19
Naz, A., Nawaz, H., Maitlo, A., & Hassan, S. M. (2021). Implementation of Selection Sort Algorithm in Various Programming Languages. International Journal of Advanced Trends in Computer Science and Engineering, 10(3), 2371–2377. https://doi.org/10.30534/ijatcse/2021/1231032021
Purnomo, R., & Putra, T. D. (2023). Theoretical Analysis of Standard Selection Sort Algorithm. SinkrOn, 8(2), 666–673. https://doi.org/10.33395/sinkron.v8i2.12153
Rabiu, A. M., Garba, E. J., Baha, B. Y., & Mukhtar, M. I. (2022). Comparative Analysis between Selection Sort and Merge Sort Algorithms. Nigerian Journal of Basic and Applied Sciences, 29(1), 43–48. https://doi.org/10.4314/njbas.v29i1.5
Selvi, S., Evert, M. A. C., & Case, B. (2021). Online Copy Available : www.ijmer.in IMPLEMENTATION OF EFFICIENT SORTING ALGORITHM IN C / C ++. 514(3), 34–40.
Singh, Y., Verma, M., Pandey, I., Saini, A., Chawla, P., & Niranjan, V. (2024). Analysis and Comparison of Various Sorting Algorithms. Tuijin Jishu/Journal of Propulsion Technology, 45(2), 5885–5890.
Vilchez, R. N. (2020). Modified Selection Sort Algorithm Employing Boolean and Distinct Function in a Bidirectional Enhanced Selection Technique. International Journal of Machine Learning and Computing, 10(1), 93–98. https://doi.org/10.18178/ijmlc.2020.10.1.904
Zhu, Z. G. (2020). Analysis and Research of Sorting Algorithm in Data Structure Based on C Language. Journal of Physics: Conference Series, 1544(1). https://doi.org/10.1088/1742-6596/1544/1/012002
Zutshi, A., & Goswami, D. (2021). Systematic review and exploration of new avenues for sorting algorithm. International Journal of Information Management Data Insights, 1(2), 100042. https://doi.org/10.1016/j.jjimei.2021.100042
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2025 Tri Dharma Putra, Rakhmat Purnomo
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
Muhammad Khoiruddin harahap
