What are the differences between std::list and std::vector containers in C++ in terms of characteristics and usage?

std::vector and std::list are containers from the C++ standard library, but they differ in structure and characteristics:

• std::vector — a dynamic array. Elements are stored in a contiguous memory area, which provides fast access by index (operation in O(1)). Adding elements to the end is usually efficient, but inserting or deleting in the middle requires shifting elements (O(n)).

• std::list — a doubly linked list. Elements are stored in separate nodes linked by pointers. Access by index is slow (O(n)), but inserting and deleting anywhere in the list is fast (O(1)), if you have an iterator to the desired element.

Usage:

• Use std::vector when fast random access and appending at the end are important.
• Use std::list if you often need to insert or delete elements in the middle of the collection and the order of elements is important.

Example:

#include <vector>
#include <list>

std::vector<int> v = {1, 2, 3};
v.push_back(4); // quickly adds to the end

std::list<int> l = {1, 2, 3};
auto it = l.begin();
std::advance(it, 1);
l.insert(it, 10); // quickly inserts before the second element