Theoretical Analysis of Standard Selection Sort Algorithm
DOI:
10.33395/sinkron.v8i2.12153Keywords:
Algorithm, Ascending, Process Iteration, Selection Sort, Theoretical AnalysisAbstract
Sorting algorithms plays an important role in the computer science field. Many applications use sorting algorithm. There are several sorting algorithms proposed by experts, namely bubble sort, exchange short, insertion short, heap sort, quick short, merge sort, standard selection sort. One well-known algorithm of sorting is selection sort. In this journal, discussion about standard selection sort is given with thorough analysis. Sorting is very important data structure concepts that has an important role in memory management, file management, in computer science in general, and in many real-life applications. Different sorting algorithms have differences in terms of time complexity, memory use, efficiency, and other factors. There are many sorting algorithms exist right now in the computer science field. Each algorithm has its benefits and limitations where a trade-off exists between execution time and the nature of the complexity of the algorithm itself. The method is theoretical analysis. Three theoretical analyses are given with deep explanation and analysis. Each with six index arrays, namely with six data on it. The numbers are sorted in ascending order. Pseudo code is also given, to understand this algorithm more thoroughly. It is concluded that this theoretical analysis explained the algorithm more clearly, by using process iteration by hand.
Downloads
References
Akshay Zade, Vinod Mandloi, P. R. B. (2020). Bilateral Selection Sort. International Journal for Research in Applied Science & Engineering Technology (IJRASET), 8(VII), 230–236.
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
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
Fagbola, T. M., & Thakur, S. C. (2019). Investigating the effect of implementation languages and large problem sizes on the tractability and efficiency of sorting algorithms. International Journal of Engineering Research and Technology, 12(2), 196–203.
Hardika, E., Atmaja, S., & Pinaryanto, K. (2020). Unjuk Kerja Selection Sort Hybrid. 17–25.
Mishra, P. (2018). A New Approach to Improve Selection Sort by the Modified Selection Sort ( MSSA ) and Performance Comparison. 3(March), 677–683.
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
Priambodo, K., & Sasongko Wibowo, J. (2021). Implementasi Algoritma Selection Sort Untuk Perangkingan Poin Pada E-Sports Tournament Garuda League. 2020, 978–979. www.garudaleague.com
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.
Shabaz, M., & Kumar, A. (2019). SA sorting: A novel sorting technique for large-scale data. Journal of Computer Networks and Communications, 2019. https://doi.org/10.1155/2019/3027578
Vilchez, R. N. (2019). Bidirectional Enhanced Selection Sort Algorithm Technique. International Journal of Applied and Physical Sciences, 5(1), 28–35. https://doi.org/10.20469/ijaps.5.50004-1
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
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) 2023 Rakhmat Purnomo, Tri Dharma Putra
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
