Abstract
Typical computer science students study the basic sorting algorithms at least three times before they graduate: first in introductory programming, then in data structures, and finally in their algorithms course. Why is sorting worth so much attention?
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Skiena, S.S. (2020). Sorting. In: The Algorithm Design Manual. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-54256-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-54256-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-54255-9
Online ISBN: 978-3-030-54256-6
eBook Packages: Computer ScienceComputer Science (R0)