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

std::set in C++: Unique Sorted Elements and Set Operations

7 mins read Last updated: 26 Sep 2026 16,494 views

On This Page0 sectionsQuick jump to subtopic

Direct Answer & Core Concept

std::set is an associative container containing unique sorted keys implemented as a Red-Black Tree. It provides $O(\log N)$ time complexity for insertions, deletions, and lookups. Duplicate values are automatically rejected on insertion.

Detailed Explanation & Mechanics

1. Mathematical Set Properties:

Uniqueness: Every element in the set must be distinct.
Ordered: Iterating over std::set traverses elements in ascending sorted order.
Immutable Elements: Keys cannot be directly mutated because changing a key would invalidate tree balance; elements must be erased and re-inserted.

main.cpp

Run Online

RED-BLACK TREE BALANCING (O(log N)):
             [ 50 ]
            /      \
        [ 20 ]    [ 80 ]
        /    \    /    \
     [ 10 ] [ 30 ] [ 70 ] [ 90 ]

Runnable Code Example: std::set in C++: Unique Sorted Elements

C++20 / C++23

main.cpp

Run Online

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

int main() {
    std::vector<int> rawData = {7, 2, 9, 2, 5, 7, 1, 9, 3};

    // Construct set: Automatically removes duplicates and sorts
    std::set<int> uniqueSorted(rawData.begin(), rawData.end());

    std::cout << "Unique Sorted Elements: ";
    for (int num : uniqueSorted) {
        std::cout << num << " ";
    }
    std::cout << "\n";

    // Insertion check
    auto [iter, inserted] = uniqueSorted.insert(5);
    std::cout << "Attempted inserting 5 again: " << (inserted ? "Inserted" : "Rejected (Duplicate)") << "\n";

    // Set membership
    if (uniqueSorted.find(9) != uniqueSorted.end()) {
        std::cout << "Element 9 exists in the set.\n";
    }
    return 0;
}

Common C++ Technical Interview Questions & Answers

Interview Prep

Q: What is the return type of `std::set::insert()`?

A: It returns a `std::pair`, where `iterator` points to the element, and `bool` indicates whether the insertion succeeded (`true`) or was rejected as a duplicate (`false`).

Q: How does `std::set` compare to `std::unordered_set`?

A: `std::set` is sorted with $O(\log N)$ operations via Red-Black Trees. `std::unordered_set` is unsorted with $O(1)$ average operations via Hash Tables.

Key Takeaways, Modern Best Practices & Idioms

C++ Best Practices & Production Rules

• Use std::set when you need both uniqueness and ordered sequence iteration.
• Use .contains(val) (available in C++20) for concise membership tests.
• Use STL set operations like std::set_union and std::set_intersection on sorted sets.

Previous Topicstd::pair in C++: Grouping Two Related Values Together

Next Topicstd::multimap in C++: Multiple Values for the Same Key