// merge algorithm example #include 
     
       #include 
      
        #include 
       
         using namespace std; int main () {
    int first[] = {
    5,10,15,20,25}; int second[] = {
    50,40,30,20,10};   vector
        
          v(10);   vector
         
          ::iterator it;   sort (first,first+5);   sort (second,second+5);   merge (first,first+5,second,second+5,v.begin());   cout << "The resulting vector contains:"; for (it=v.begin(); it!=v.end(); ++it)     cout << " " << *it;   cout << endl; return 0; }