Abstract
The number of comparisons made in merge insertion sort
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Algorithms. Addison-Wesley, (1974)
Ford, L.R., Johnson, S.M.: A tournament problem. Amer. Math. Monthly 66, (1959) 387–389
Knuth, D.E.: The Art of Computer Programming Vol.3: Sorting and Searching. Addison-Wesley, (1973)
Manacher, G.K.: The Ford-Johnson sorting algorithm is not optimal. Proc. of the 15th Allerton Conf. on Communication, Control, and Computing, (1977) 390–397
Wells, M.B.: Applications of a language for computing in combinatorics. Proc. IFIP Congress 65, (1965) 497–498
Wells, M.B.: Elements of Combinatorial Computing. Pergamon Press, (1971)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kasai, T., Sawato, S., Iwata, S. (1994). Thirty four comparisons are required to sort 13 items. In: Jones, N.D., Hagiya, M., Sato, M. (eds) Logic, Language and Computation. Lecture Notes in Computer Science, vol 792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032405
Download citation
DOI: https://doi.org/10.1007/BFb0032405
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57935-9
Online ISBN: 978-3-540-48391-5
eBook Packages: Springer Book Archive