An Enhancement of Major Sorting Algorithms

One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number ofsorting algorithms, sorting problem has attracted a great deal of research; because efficient sorting is important to optimizethe use of other algorithms. This paper presents two new sorting algorithms, enhanced selection sort and enhanced bubbleSort algorithms. Enhanced selection sort is an enhancement on selection sort by making it slightly faster and stable sortingalgorithm. Enhanced bubble sort is an enhancement on both bubble sort and selection sort algorithms with O(nlgn) complexityinstead of O(n2) for bubble sort and selection sort algorithms. The two new algorithms are analyzed, implemented, tested, andcompared and the results were promising