A new algorithm for sorting small integers

Abstract EN

This paper presents a new sorting algorithm called RAMI-Sort algorithm.

The RAMI-Sort algorithm enhanced the time complexity of the best, average, and worst cases of many standard sorting algorithms, such as Quicksort, Cocktail sort, and Shell sort, when dealing with a large size of the input array especially when the integer values of the elements were small and distinct.

The proposed algorithm and many standard sorting algorithms have been applied in a real-world case study simulation and compared.