dafukinsun @dafukinsun - Tumblr Blog

Standard-library sort function can not be used to sort values that are stored in a list.

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

#std::list #sort #algorithm #C++#STL

Operations erase and push_back for std::list do not invalidate iterators to other elements

#std::list #C++#STL #erase #push_back #iterators

std::list does not support indexing

std::vector does

#std::vector #std::list #STL #C++#indexing #container

std::list is optimized for fast insertion and deletion anywhere within the container

#std::list #list #STL #C++#container

std::vector.erase

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

#std::vector #C++#STL #erase #std::vector.erase

std::vector.erase is slow

O(n^2) algorithm

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).

#std::vector #vector #STL #C++#std::vector.erase #erase

std::vector is optimized for fast random access

#STL #std::vector #vector #random access #optimization #C++

Trending Blogs

Recently Viewed Blogs

dafukinsun