Search⌘ K
Home
Courses
C++ High Performance

Best Practices

Discover how to improve C++ code efficiency by leveraging standard library algorithms effectively. Learn to use C++20 constrained algorithms that simplify usage and improve error handling. Understand when to use sort(), partial_sort(), and nth_element() to avoid unnecessary full-range sorting, enhancing performance in large data sets.

We'll cover the following...

Let’s consider practices that will help out when working with the algorithms we’ve been discussing. We will start by highlighting the importance of actually exploiting the standard algorithms.

Using the constrained algorithms

The constrained algorithms under std::ranges introduced with C++20 offer some benefits over the iterator-based algorithms under std. The constrained algorithms do the following:

  • Support projections, which simplifies custom comparisons of elements.
  • Support ranges instead of iterator pairs. There is no need to pass begin() and end() iterators as separate arguments.
  • Are easy to use correctly and provide
...