Determine elements in both two sets : set_intersection « STL Algorithms Merge « C++

1. C++
2. STL Algorithms Merge
3. set_intersection

Determine elements in both two sets

 
 

#include <iostream>
using std::cout;
using std::endl;

#include <algorithm>
#include <iterator>

int main()
{
   const int SIZE1 = 10, SIZE2 = 5, SIZE3 = 20;
   int a1[ SIZE1 ] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
   int a2[ SIZE2 ] = { 4, 5, 6, 7, 8 };
   int a3[ SIZE2 ] = { 4, 5, 6, 11, 15 };
   std::ostream_iterator< int > output( cout, " " );

   std::copy( a1, a1 + SIZE1, output );
   cout << "\n";
   std::copy( a2, a2 + SIZE2, output );
   cout << "\n";
   std::copy( a3, a3 + SIZE2, output );

   int intersection[ SIZE1 ];

   int * ptr = std::set_intersection( a1, a1 + SIZE1, a2, a2 + SIZE2, intersection );
   cout << "nset_intersection of a1 and a2 is: ";
   std::copy( intersection, ptr, output );
      
   return 0;
}

/* 
1 2 3 4 5 6 7 8 9 10
4 5 6 7 8
4 5 6 11 15 nset_intersection of a1 and a2 is: 4 5 6 7 8
 */        
  

Related examples in the same category