Abstract
We will now consider several algorithmic problems of a purely combinatorialnature. These include sorting and searching, both among the first non-numericalproblems arising on electronic computers. Sorting can be viewed as identifyingor imposing a total order on the keys, while searching and selection involveidentifying specific keys based on their position in this total order
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. (2020). Combinatorial Problems. In: The Algorithm Design Manual. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-54256-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-54256-6_17
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)