The fastest way to find union of sets

Question

I have sets of pairs of int like set > x1, x2, ... xn ( n can be between 2 and 20). What is the fastest way to find union of those se

Answer 1

Try the set_union in the header algorithm.