C + + Primer Reading notes: 11th chapter Generic algorithm

11th generic algorithm 1. Overview

The generic algorithm relies on iterators, rather than relying on containers, to specify the range of functions, that is, [start, end], representing the interval, as shown above

It also requires that the elements are comparable, and if the elements themselves are not comparable, then you can define the comparison function yourself.

2. Commonly used generic algorithm functions:

Fill,fill_n, copy, replace, sort, unique, count_if, Stable_sort

In addition, there is a predicate function used in conjunction with the above functions, like sort, count_if, etc.

3. Re-talk about iterators

(1) inserting an iterator

Back_inserter, Front_inserter, Inserter

(2) Iostream iterator

(3) Reverse iterator

4. Structure of generic algorithms

C + + Primer Reading notes: 11th chapter Generic algorithm