Standard C++ Library Class Reference

OutputIterator result, Compare comp);
Description
The set_difference algorithm constructs a sorted difference that includes copies of the elements
that are present in the range [first1, last1) but are not present in the range [first2, last2). It
returns the end of the constructed range.
As an example, assume we have the following two sets:
1 2 3 4 5
and
3 4 5 6 7
The result of applying set_difference is the set:
1 2
The result of set_difference is undefined if the result range overlaps with either of the original
ranges.
set_difference assumes that the ranges are sorted using the default comparision operator less
than (<), unless an alternative comparison operator (comp) is provided.
Use the set_symetric_difference algorithm to return a result that contains all elements that are
not in common between the two sets.
Complexity
At most ((last1 - first1) + (last2 - first2)) * 2 -1 comparisons are performed.
Example
//
// set_diff.cpp
//
#include <algorithm>
#include <set>
#include <iostream.h>
int main()
{
//Initialize some sets
int a1[10] = {1,2,3,4,5,6,7,8,9,10};
int a2[6] = {2,4,6,8,10,12};
set<int, less<int> > all(a1, a1+10), even(a2, a2+6),
odd;