Abstract
Sorting is an old and well-known problem with well-studied and analysed solutions. Here we shall use it as an example of algorithm design and discuss the choices which can be made regarding its 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.
Bibliographic Notes and Further Reading
Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1974). The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts.
Darlington, J. (1978). ‘A synthesis of several sorting algorithms’, Acta Informatica, Vol. 11, pp. 1–30.
Hoare, C. A. R. (1962). ‘Quicksort’, Computer Journal, Vol. 5, No. 1, pp. 10–15.
Knuth, D. E. (1972). The Art of Computer Programming. Volume 3: Sorting and Searching, Addison-Wesley, Reading, Massachusetts.
Merritt, S. M. (1985). ‘An inverted taxonomy of sorting algorithms’, CACM, Vol. 28, No. 1, pp. 96–99.
Author information
Authors and Affiliations
Copyright information
© 1990 Manoochehr Azmoodeh
About this chapter
Cite this chapter
Azmoodeh, M. (1990). Sorting: An Algorithm on the ADT List. In: Abstract Data Types and Algorithms. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-21151-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-349-21151-7_9
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-51210-4
Online ISBN: 978-1-349-21151-7
eBook Packages: Computer ScienceComputer Science (R0)