std::list
Doubly linked list: O(1) insert/erase anywhere given an iterator, no random access.
Easy
Usually slower than vector because of poor cache locality.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.