May 2013
Intermediate to advanced
1376 pages
47h 26m
English
Form is liberating.
– Engineer’s proverb
Sequences; Policy Arguments; Complexity
• Nonmodifying Sequence Algorithms
for_each(); Sequence Predicates; count(); find(); equal() and mismatch(); search()
• Modifying Sequence Algorithms
copy(); unique(); remove(), reverse(), and replace(); rotate(), random_shuffle(), and partition(); Permutations; fill(); swap()
Binary Search; merge(); Set Algorithms; Heaps; lexcographical_compare()
• Advice
This chapter presents the STL algorithms. The STL consists of the iterator, container, algorithm, and function object parts of the standard library. The rest of the STL is presented in Chapter 31 and Chapter ...
Read now
Unlock full access