Modified Selection Sort Algorithm Employing Boolean and Distinct Function in a Bidirectional Enhanced Selection Technique

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.

Theoretical Analysis of Standard Selection Sort Algorithm

“…In their research, Vilchez tried to reduce the number of comparisons and iterations that usually causes the delay in terms of sorting. The results showed that the modified algorithm has a significant run time complexity improvement compared with other O(n 2 ) algorithms (Vilchez, 2020). The sorting algorithm must be effective, less complex, stable, and more efficient.…”

“…They could validate running time complexity. Their research results showed that the newly created selection sort algorithm by using distinct and boolean function in the technique of a bidirectional enhance selection has a significant improvement in terms of run time complexity compared with other sorting algorithms (Vilchez, 2020). Alotaibi proposed a new in-place sorting algorithm called OneByOne (OBO) sort.…”

“…Sorting is very important in the concept of computer science that plays a very important role in memory management, file management, and other real-life applications (Vilchez, 2020). Different sorting algorithms have differences in terms of time complexity, memory use, efficiency, and other factors (Zutshi & Goswami, 2021).…”