Abstract
Telephone directories are sorted alphabetically by last name.Why? Because a sorted index can be searched quickly. Even in the telephone directory of a huge city, one can find a name in a few seconds. In an unsorted index, nobody would even try to find a name. This chapter teaches you how to turn an unordered collection of elements into an ordered collection, i.e., how to sort the collection. The sorted collection can then be searched fast. We will get to know several algorithms for sorting; the different algorithms are suited for different situations, for example sorting in main memory or sorting in external memory, and illustrate different algorithmic paradigms. Sorting has many other uses as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sanders, P., Mehlhorn, K., Dietzfelbinger, M., Dementiev, R. (2019). Sorting and Selection. In: Sequential and Parallel Algorithms and Data Structures. Springer, Cham. https://doi.org/10.1007/978-3-030-25209-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-25209-0_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25208-3
Online ISBN: 978-3-030-25209-0
eBook Packages: Computer ScienceComputer Science (R0)