Abstract—A sorting algorithm is a step by step procedure in arranging items on the list in particular order (ascending or descending). Sorting is one of the important data structure concepts that play a vital role in computer systems, file management, memory management, and many real-life applications. Among the sort algorithm, selection sort is the simplest and very straightforward. However, selection sort is considered the second worst algorithm concerning time complexity for large data. Due to the lousy performance of selection sort on large data, several enhancements were developed to improve runtime complexity. These enhancements have a significant improvement on the runtime complexity of the classical selection sort. However, the procedures presented in all these enhancements can still lead to some unnecessary comparisons, swapping and iterations that cause poor sorting performance. This study focuses on finding a remedy on the identified problems of the selection sort such as runtime complexity and unstable sorting by modifying the selection sort algorithm. The modified algorithm was tested using various data to validate the performance. The result was compared with the other available sorting algorithms to validate running time complexity. The results show that the Modified Selection Sort Algorithm Employing Boolean and Distinct Function in a Bidirectional Enhanced Selection Technique has a significant runtime complexity improvement compared with the other sorting algorithms. This study has a significant contribution to the field of data structures in computer science.
Index Terms—Algorithm, bidirectional sorting, flag, selection sort, sorting.
Ramcis N. Vilchez is with the Technological Institute of the Philippines (TIP), 938 Aurora Blvd, Cubao, Quezon City, Metro Manila, Philippines (e-mail: ramcis_vilchez@umindanao.edu.ph).
Cite: Ramcis N. Vilchez, "Modified Selection Sort Algorithm Employing Boolean and Distinct Function in a Bidirectional Enhanced Selection Technique," International Journal of Machine Learning and Computing vol. 10, no. 1, pp. 93-98, 2020.
Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).