How to apply algorithms and generics in C++

This article mainly explains "how to apply algorithms and generic algorithms in C++", interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Next, let the editor take you to learn how to apply algorithms and generics in C++.

The algorithms included in this paper are:

Read-only algorithms: find (), count (), accumulate (), equal ()

Writing algorithm: fill (), fill_n (), back_inserter (), copy (), copy_backward (), replace (), replace_copy (), next_permutation (), prev_permutation ()

Rearranging element algorithms: sort (), stable_sort (), unique ()

A brief introduction to the algorithm

Most algorithms are in the header file algorithm. The standard library also defines a set of numeric generics algorithms in the header file numeric

How the algorithm works:

The iterator makes the algorithm independent of the container type: the algorithm does not depend on the type of element that the container holds. Operations can be performed as long as there is an iterator that can access the element

But the algorithm depends on the operation of the element type: although the iterator makes the algorithm independent of the container type, most algorithms use an operation on one (more) element type. For example, find uses the = = operator of the element type to compare each element to a given value. Other algorithms may require element type support