What are the best practices for using iterators with C++11 algorithms?

What are the best practices for using iterators with C++11 algorithms?

When using iterators with C++11 algorithms, it's important to ensure that your iterators are valid and that they point to the correct range of elements. Always prefer using auto for type deduction to avoid type mismatches.

Can you give an example of using std::for_each with iterators?

Sure! Here's a simple example:

#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> vec = {1, 2, 3, 4, 5};
    std::for_each(vec.begin(), vec.end(), [](int n) { std::cout << n << ' '; });
    return 0;
}

This code uses std::for_each to print each element in the vector.

What should I avoid when using iterators?

Avoid using invalidated iterators, which can happen if you modify the container while iterating over it. Also, be cautious with iterator types; mixing different types can lead to undefined behavior.

Are there any performance considerations I should keep in mind?

Yes, prefer using const_iterator when you don't need to modify the elements, as it can help the compiler optimize your code. Additionally, using algorithms from the standard library can often be more efficient than manual loops.