Abstract
On 28 July 1959, D. L. Shell described a minimal storage sorting method which has generally become known as the Shellsort, although it is sometimes called the Merge—Exchange or Diminishing Increment Sort. Much attention has been paid to it and there is still active discussion of its properties.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© 1986 Keith McLuckie and Angus Barber
About this chapter
Cite this chapter
McLuckie, K., Barber, A. (1986). Shell's Sort. In: Sorting Routines for Microcomputers. Palgrave, London. https://doi.org/10.1007/978-1-349-08147-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-349-08147-9_3
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-39587-5
Online ISBN: 978-1-349-08147-9
eBook Packages: Computer ScienceComputer Science (R0)