Swap elements in first five elements of an array with elements in last five elements : swap_ranges « STL Algorithms Modifying sequence operations « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » STL Algorithms Modifying sequence operations » swap_rangesScreenshots 
Swap elements in first five elements of an array with elements in last five elements
 
 

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

#include <algorithm>
#include <iterator> 

int main()
{
   int a10 12345678910 };
   std::ostream_iterator< int > outputcout, " " );

   cout << "Array a contains:\n   ";
   std::copya, a + 10, output );

   std::swap_rangesa, a + 5, a + );

   std::copya, a + 10, output );

   cout << endl;
   return 0;
}

/* 
Array a contains:
   1 2 3 4 5 6 7 8 9 10 6 7 8 9 10 1 2 3 4 5

 */        
  
Related examples in the same category
1.Illustrating the generic swap_ranges algorithm
2.Use swap_ranges to swap elements in one container with corresponding elements in another container
3.Use swap_ranges to mirror first three with last three elements
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.