Topic 53 of 91 9. C++ Standard Template Library (STL) Interactive Tutorial

STL Containers Explained: Sequence, Associative, and Unordered Collections

8 mins read Last updated: 26 Sep 2026 15,261 views

On This Page0 sectionsQuick jump to subtopic

Direct Answer & Core Concept

STL containers are grouped into Sequence Containers (vector, deque, list, array - maintaining linear insertion order), Associative Containers (map, set, multimap, multiset - ordered trees with $O(\log N)$ lookup), Unordered Containers (unordered_map, unordered_set - hash tables with average $O(1)$ lookup), and Container Adapters (stack, queue, priority_queue).

Detailed Explanation & Mechanics

1. Comprehensive Container Decision Matrix:

Architecture Diagram

┌─────────────────┬────────────────────┬─────────────────┬────────────────────────────┐
│ Container Type  │ Underlying Layout  │ Lookup Speed    │ Best Use Case              │
├─────────────────┼────────────────────┼─────────────────┼────────────────────────────┤
│ std::vector     │ Contiguous Dynamic │ O(1) by Index   │ Default general container  │
│ std::deque      │ Chunked Arrays     │ O(1) by Index   │ Fast push/pop front & back │
│ std::list       │ Doubly Linked List │ O(N) Sequential │ Fast mid insertion/splice  │
│ std::map / set  │ Red-Black Tree     │ O(log N)        │ Sorted keys, range queries │
│ std::unordered_*│ Hash Bucket Table  │ O(1) Average    │ Ultra-fast key lookup      │
└─────────────────┴────────────────────┴─────────────────┴────────────────────────────┘

Runnable Code Example: STL Containers

C++20 / C++23

main.cpp

Run Online

#include <iostream>
#include <vector>
#include <set>
#include <unordered_map>

int main() {
    // Sequence: Vector (Contiguous cache-friendly)
    std::vector<int> seq = {10, 20, 30};

    // Associative: Set (Automatically sorted, unique keys)
    std::set<std::string> sortedTags = {"database", "backend", "api", "architecture"};

    // Unordered: Hash Map (O(1) average lookup)
    std::unordered_map<std::string, int> portMapping = {
        {"http", 80}, {"https", 443}, {"ssh", 22}
    };

    std::cout << "Sorted Tags: ";
    for (const auto& tag : sortedTags) std::cout << tag << " ";
    std::cout << "\n";

    std::cout << "Port for 'https': " << portMapping["https"] << "\n";
    return 0;
}

Common C++ Technical Interview Questions & Answers

Interview Prep

Q: Why is `std::vector` the recommended default container in C++?

A: Due to CPU cache locality. Contiguous memory layout allows the CPU prefetcher to load adjacent elements into L1/L2 cache lines with minimal cache misses.

Q: When is `std::list` worse than `std::vector` even for insertions?

A: `std::list` allocates node objects individually on the heap, causing memory fragmentation and cache misses during traversal that often outweigh vector copy costs.

Key Takeaways, Modern Best Practices & Idioms

C++ Best Practices & Production Rules

• Use std::vector as the default container unless specialized behavior is strictly required.
• Use std::unordered_map for key-value lookups when ordering is irrelevant.
• Reserve capacity in dynamic containers (vec.reserve(n)) when the anticipated size is known.

Previous TopicSTL Algorithms in C++: Searching, Sorting, Modifying, and Processing Data

Next Topicstd::vector in C++: Dynamic Arrays, Capacity, and Common Operations