The STL algorithms offer a powerful way to solve some base programming use cases. If you know and use these algorithms you can write more clean, efficient and robust code. But unfortunately, it isn’t that easy to know or find the right algorithm for a use case. In my opinion, this is a result of the not practical kind of documentation – especially grouping of the algorithms is not related to practice – and on the other hand the naming of some functions. Therefore, I wrote a series of articles with a practice-related overview about the STL algorithms. Following you will find the overview about this article series with links to the articles.
Algorithms to use, find and check container elements
Algorithms to copy, move and remove container elements
Algorithms to change and sort container elements
Algorithms for sorted containers
coders corner 