What is the intersection of two sets in C++?

Can you explain what the intersection of two sets is in C++?

Sure! The intersection of two sets is a new set that contains all the elements that are common to both sets.

How can I implement this in C++?

You can use the Standard Template Library (STL) in C++. Specifically, you can use the set_intersection function from the <algorithm> header.

Can you provide a code example?

Of course! Here's a simple example:

#include <iostream>
#include <set>
#include <algorithm>

int main() {
    std::set<int> set1 = {1, 2, 3, 4};
    std::set<int> set2 = {3, 4, 5, 6};
    std::set<int> result;

    std::set_intersection(set1.begin(), set1.end(), set2.begin(), set2.end(), std::inserter(result, result.begin()));

    for (int num : result) {
        std::cout << num << " ";
    }
    return 0;
}