An Empirical Study for Inversions-Sensitive Sorting Algorithms
- Cite this paper as:
- Elmasry A., Hammad A. (2005) An Empirical Study for Inversions-Sensitive Sorting Algorithms. In: Nikoletseas S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg
We study the performance of the most practical internal adaptive sorting algorithms. Experimental results show that adaptive AVL sort performs the least number of comparisons unless the number of inversions is fewer than 1%. In such case, Splaysort performs the fewest number of comparisons. On the other hand, the running time of Quicksort is superior unless the number of inversions is fewer than 1.5%. In such case, Splaysort consumes the smallest running time.
Unable to display preview. Download preview PDF.