Abstract
The standard library includes a suite of functions, which the library calls algorithms, to simplify many programming tasks that involve repeated application of operations over sequential data. The data can be a container of objects, a portion of a container, values read from an input stream, or any other sequence of objects that you can express with iterators. I’ve been introducing various algorithms when appropriate; this Exploration takes a closer look at a number of the most useful algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Ray Lischner
About this chapter
Cite this chapter
(2009). Useful algorithms. In: Exploring C++. Apress. https://doi.org/10.1007/978-1-4302-0352-0_41
Download citation
DOI: https://doi.org/10.1007/978-1-4302-0352-0_41
Publisher Name: Apress
Print ISBN: 978-1-59059-749-1
Online ISBN: 978-1-4302-0352-0
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books