An extensive comparative analysis of sorting algorithms with quadratic complexity on small integer arrays
An extensive comparative analysis of sorting algorithms with quadratic complexity on small integer arrays

Summary/Abstract: A well-known fact is that lots of sorting algorithms with quadratic complexity are faster than the best-performing algorithms (e.g., quicksort and merge sort) on small data sets. Thus, we use them to improve the performance of the best sorting algorithms at a specific phase of their execution. In this study, we examine the performance of the most famous sorting algorithms with quadratic complexity, including quicksort, on small integer arrays. We count the number of comparisons and swaps for all possible permutations of integers in arrays with sizes less than 10. The obtained distributions of the performance reflect the specifics of the related sorting algorithms and can be used for academic and educational purposes. Additionally, we present a new sorting algorithm specially designed for a small number of elements and compare it to the rest.

• Details
• Contents