What are some iterator algorithms introduced in C++11?

What are some iterator algorithms introduced in C++11?

C++11 introduced several iterator algorithms, including std::begin, std::end, std::next, and std::prev. These help in working with ranges.

Can you explain how std::next works?

Sure! std::next takes an iterator and returns an iterator pointing to the next element, optionally allowing you to specify how many steps to move forward.

What about std::prev?

std::prev is similar but moves the iterator backward. It returns an iterator pointing to the element before the given one.

Are there any examples of using these algorithms?

Yes! For example, if you have a vector, you can use std::next to get an iterator to the second element like this: auto it = std::next(vec.begin(), 1);.