Question
I found this example code example on cppreference.com at (en.cppreference.com/w/cpp/algorithm/set_intersection) std::vector v1{1,2,3,4,5,6,7,8}; std::vector v2{ 5, 7, 9,10}; std::sort(v1.begin(), v1.end()); std::sort(v2.begin(), v2.end()); std::vector v_intersection; std::set_intersection( v1.begin(),
I found this example code example on cppreference.com at (en.cppreference.com/w/cpp/algorithm/set_intersection)
std::vector
std::vector
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
std::vector
std::set_intersection( v1.begin(), v1.end(),
v2.begin(), v2.end(),
std::back_inserter(v_intersection));
-----------------------------------------------------------------
I understand the begin(), and end() parts, but what about this: "back_inserter(v_intersection)"
What does it do exactly? to ensure output is in the right order, I guess?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started