dafukinsun

std::list provides its own sort member function, which uses an algorithm that is optimized for sorting data stored in a list.

std::vector does

erase returns an iterator that is positioned on the element that follows the one that we just erased

Because vectors use an array as their underlying storage, erasing elements in positions other than the vector end causes the container to relocate all the elements after the segment erased to their new positions. This is generally an inefficient operation compared to the one performed for the same operation by other kinds of sequence containers (such as list or forward_list).