An enhancement of major sorting algorithms

Abstract EN

One of the fundamental issues in computer science is ordering a list of items.

Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research; because efficient sorting is important to optimize the use of other algorithms.

This paper presents two new sorting algorithms, enhanced selection sort and enhanced bubble Sort algorithms.

Enhanced selection sort is an enhancement on selection sort by making it slightly faster and stable sorting algorithm.

Enhanced bubble sort is an enhancement on both bubble sort and selection sort algorithms with O (nlgn) complexity instead of O (n2) for bubble sort and selection sort algorithms.

The two new algorithms are analyzed, implemented, tested, and compared and the results were promising.