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(), 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?