Abstract
We prove that sorting 13 elements requires 34 comparisons. This solves a long-standing problem posed by D.E.Knuth in his famous book The Art of Computer Programming, Volume 3, Sorting and Searching The result is due to an efficient implementation of an algorithm for counting linear extensions of a given partial order. We present also some useful heuristics which allowed us to decrease the running time of the implementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brightwell, G., Winkler, D.:Counting Linear Extensions.Order 8 (1991)225–242
Ford, L., Johnson, S.: A Tournament Problem.American Mathematical Monthly66 (1959)387–389
Knuth, D.E.: The Art of Computer Programming,Vol.3.Sorting and Searching,2nd ed. Addison-Wesley (1998)
Knuth, D.E., Kaehler E.B.:An Experiment in Optimal Sorting.Information Processing Letters 1 (1972)173–176
Pruesse, G., Ruskey F.:Generating Linear Extensions Fast.SIAM Journal on Computing 23 (1994)373–386
Ullman, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the ACM 23(1976)31–42
Wells, M.: Elements of Combinatorial Computing.Pergamon Press (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peczarski, M. (2002). Sorting 13 Elements Requires 34 Comparisons. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_68
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive