Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brodal, G., Fagerberg, R., Moruz, G.: On the adaptiveness of quicksort. In: 7th (ALENEX) Workshop on Algorithm Engineering and Experiments (2005)
Cole, R.: On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM J. Computing 30, 44–85 (2000)
Cook, R., Kim, J.: Best sorting algorithms for nearly sorted lists. Commun. ACM 23, 620–624 (1980)
Elmasry, A.: Adaptive sorting with AVL trees. In: 3rd IFIP-WCC International Conference on Theoretical Computer Science, pp. 315–324 (2004)
Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys 24(4), 441–476 (1992)
Guibas, L., McCreight, E., Plass, M., Roberts, J.: A new representation of linear lists. 9th ACM (STOC) Symposium on Theory of Computing 9, 49–60 (1977)
Hoare, C.: Algorithm 64: Quicksort. Commun. ACM 4(7), 321 (1961)
Levcopoulos, C., Petersson, O.: Splitsort - An adaptive sorting algorithm. Information Processing Letters 39, 205–211 (1991)
Levcopoulos, C., Petersson, O.: Adaptive Heapsort. J. Alg. 14, 395–413 (1993)
Moffat, A., Eddy, G., Petersson, O.: Splaysort: fast, versatile, practical. Softw. Pract. and Exper. 126(7), 781–797 (1996)
Sleator, D., Tarjan, R.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)
Vuillemin, J.: A unifying look at data structures. Commu. ACM 23, 229–239 (1980)
Wainwrigh, R.: A class of sorting algorithms based on quicksort. Commun. ACM 28(4), 396–402 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/11427186_52
Download citation
DOI: https://doi.org/10.1007/11427186_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)