Bidirectional Enhanced Selection Sort Algorithm Technique

Sorting algorithm refers to the arranging of numerical or alphabetical or character data in statistical order (ascending or descending). Sorting algorithm plays a vital role in searching and the field of data science. Most of the sorting algorithms with O(n2) time complexity are very efficient for a small list of elements. However, for large data, these algorithms are very inefficient. This study presented a remedy for the noted deficiencies of O(n2) sort algorithm for large data. Among the O(n2) algorithms, selection sort was the subject of the study considering its simplicity. Although selection sort is regarded as the most straightforward algorithm, it is also considered the second worst algorithm in terms of time complexity for large data. Several enhancements were conducted to address the inefficiencies of selection sort. However, the procedures presented in all the enhancements can still lead to some unnecessary comparisons, and iterations that cause poor sorting performance. The modified selection sort algorithm utilizes a Bidirectional Enhanced Selection Sort Algorithm Technique to reduce the number of comparisons and iterations that causes sorting delays. The modified algorithm was tested using varied data to validate the performance. The result was compared with the other O(n2) algorithm. The results show that the modified algorithm has a significant run time complexity improvement compared with the other O(n2) algorithms. This study has a significant contribution to the field of data structures in computer science and the field of data science.