Enhanced quicksort algorithm

Abstract EN

Sorting is considered as one of the important issues of computer science.

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.

It is also often in producing human-readable output.

This paper presents a new sorting algorithm called SMS-algorithm (Scan, Move, and Sort).

The SMS algorithm is considered as an enhancement on the Quicksort algorithm in the best, average, and worst cases when dealing with an input array of a large size and when the maximum and the minimum values were small, especially when sorting a list of distinct elements.

The SMS algorithm is compared with the Quicksort algorithm and the results were promising.