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.

1. G. Franceschini and V. Geffert, “An in-place sorting with o (n log n) comparisons and o (n) moves,” in 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003. doi: https://doi.org/10.1109/sfcs.2003.1238198
2. Y. Han, “Deterministic sorting in o (n log log n) time and linear space,” in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, New York, NY, 2002. doi: https://doi.org/10.1145/509907.509993
3. M. Khairullah, “Enhancing worst sorting algorithms,” International Journal of Advanced Science and Technology, vol. 56, pp. 13–26, 2013.
4. L. Jeeyoung, G. Habimana, H. K. K. T. Jeong, and K. Sunkuk, “Panelizing algorithms for free-form concrete panels considering esthetic surfaces,” International Journal of Technology and Engineering Studies, vol. 1, no. 3, pp. 81–86, 2015. doi: https://doi.org/10.20469/ijtes.40003-3
5. N. Ugtakhbayar, B. Usukhbayar, S. H. Sodbileg, and J. Nyamjav, “Detecting TCP based attacks using data mining algorithms,” International Journal of Technology and Engineering Studies, vol. 2, no. 1, pp. 1–4, 2016. doi: https://doi.org/10.20469/ijtes.2.40001-1
6. S. Lakra and Divya, “Improving the performance of selection sort using a modified double-ended selection sorting,” International Journal of Application or Innovation in Engineering & Management (IJAIEM), vol. 2, no. 5, pp. 364–370, 2013.
7. S. Chand, T. Chaudhary, and R. Parveen, “Upgraded selection sort,” International Journal on Computer Science and Engineering, vol. 3, no. 4, pp. 1633–1637, 2011.
8. J. Hayfron-Acquah, O. Appiah, K. Csir Riverson, and G. Accra, “Improved selection sort algorithm,” International Journal of Computer Applications, vol. 110, no. 5, pp. 29–33, 2015. doi: https://doi.org/10.5120/19314-0774
9. E. Uma and A. Kannan, “Self-aware message validating algorithm for preventing XML-based injection attacks,” International Journal of Technology and Engineering Studies, vol. 2, no. 3, pp. 60–69, 2016. doi: https://doi.org/10.20469/ijtes.2.40001-3
10. A. H. Al-Saeedi and O. Altun, “Binary Mean-variance Mapping Optimization algorithm (BMVMO),” Journal of Applied and Physical Sciences, vol. 2, no. 2, pp. 42–47, 2016. doi:
    https://doi.org/10.20474/japs-2.2.3
11. M. Kumar, M. Malhotra, and D. Ahuja, “Minimizing the execution time of selection sort algorithm,” International Journal of Engineering and Computer Science, vol. 6, no. 4, pp. 21 006–21 010, 2017. doi: https://doi.org/10.18535/ijecs/v6i4.37
12. K. Thabit, E. Alsaggaf, and F. Bahareth, “New approach for dynamic bubble sort improvement,” Research Notes in Information Science (RNIS), vol. 14, pp. 245–252, 2013.
13. M. P. K. Chhatwani, “Insertion sort with its enhancement,” International Journal of Computer Science and Mobile Computing, vol. 3, no. 3, pp. 801–806, 2014.
14. A. S. Mohammed, S. E. Amrahov, and F. V. Celebi, “Bidirectional conditional insertion sort algorithm; an efficient progress on the classical insertion sort,” Future Generation Computer Systems, vol. 71, pp. 102–112, 2017. doi: https://doi.org/10.1016/j.future.2017.01.034
15. J. Dua, “Enhanced bidirectional selection sort,” World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering, vol. 8, no. 7, pp. 1266–1269, 2014.
16. M. F. Umar, E. U. Munir, S. A. Shad, and M. W. Nisar, “Enhancement of selection, bubble and insertion sorting algorithm,” Research Journal of Applied Sciences, Engineering and Technology, vol. 8, no. 2, pp. 263–271, 2014.
17. A. Brijwal, A. Goel, A. Papola, and J. K. Gupta, “Both ended sorting algorithm & performance comparison with existing algorithm,” International Journal of IT, Engineering and Applied Sciences Research (IJIEASR), vol. 3, no. 6, pp. 4–9, 2014.
18. R. M. Patelia, S. D. Vyas, P. S. Vyas, and N. S. Patel, “An enhanced selection sort algorithm,” International Journal of Advanced Technology in Engineering and Science, vol. 3, no. 1, pp. 153–157, 2015.
19. S. Jadoon, S. F. Solehria, S. Rehman, and H. Jan, “Design and analysis of optimized selection sort algorithm,” International Journal of Electric & Computer Sciences (IJECS-IJENS), vol. 11, no. 1, pp. 16–22, 2011.

Vilchez, R. N. (2019). Bidirectional enhanced selection sort algorithm technique. International Journal of Applied and Physical Sciences, 5(1), 01-07. doi: https://dx.doi.org/10.20469/ijaps.5.50004-1