Explore the full potential of C++ by mastering the standard library.

Become a C++ Programmer

The C++ standard library is a collection of all the tools and utilities available in C++. It received its latest update in 2017, known as C++17. The update introduces many new features that further optimize our code. This module will help us fully grasp C++ and use it to its full potential.

C++ Standard Library

To use the algorithms, you have to keep a few rules in your head. 

The algorithms are defined in various headers.


`<algorithm>`: 
\
Contains the general algorithms.


`<numeric>`: 
\
Contains the numeric algorithms.
Many of the algorithms have the name suffix 
`_if` and `_copy`.

`_if`: 
\
The algorithm can be parametrized by a [predicate](#textXXXpredicate).

`_copy`: 
\
The algorithm copies its elements in another range.

Algorithms like `auto num = std::count(InpIt first, InpIt last, const T& val)` return the number of elements that are equal to `val`. `num` is of type `iterator_traits<InpIt>::difference_type`. You have the guarantee that `num` is sufficient to hold the result. Because of the automatic return type deduction with `auto`, the compiler will give you the right types. 

> 🔑 **If the container uses an additional range, it has to be valid**
\
The algorithm [std::copy_if](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/copy-elements-and-ranges) uses an iterator to the beginning of its destination range. This destination range has to be valid. 

> ℹ️ **Naming conventions for the algorithms**
\
I use a few naming conventions for the type of arguments and the return type of the algorithms to make them easier to read.

| **Name** | **Description** |
|-|-|
| `InIt`| [Input iterator]|
| `FwdIt` | [Forward iterator]|
| `BiIt`| [Bidirectional iterator]|
|  |  |
|  |  |
| `UnFunc` | [Unary callable] |
| `BiFunc` | [Binary callable] |
|  |  |
|  |  |
| `UnPre` | [Unary predicate]|
| `BiPre` | [Binary predicate]|
| `Search` | The [searcher](https://en.cppreference.com/w/cpp/algorithm/search) encapsulates the search algorithm. |
|  |  |
|  |  |
| `ValType` | From the input range automatically deduced value type. |
|  |  |
|  |  |
| `ExePol` | [Execution policy](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/sequential-parallel-or-parallel-execution-with-vectorisation) |
<p> <strong> Signature of the algorithms </strong> </p>


What are the rules and terminologies needed to run algorithms? Let's find out.

Conventions