1   // Fig. 16.7: fig16_07.cpp
 2   // Algorithms iter_swap, swap and swap_ranges.
 3   #include <iostream>
 4   #include <array>
 5   #include <algorithm> // algorithm definitions
 6   #include <iterator>
 7   using namespace std;
 8
 9   int main()
10   {
11      const size_t SIZE = 10;
12      array< int, SIZE > a = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
13      ostream_iterator< int > output( cout, " " );
14
15      cout << "Array a contains:    ";
16      copy( a.cbegin(), a.cend(), output ); // display array a
17
18      swap( a[ 0 ], a[ 1 ] ); // swap elements at locations 0 and 1 of a
19
20      cout << " Array a after swapping a[0] and a[1] using swap:    ";
21      copy( a.cbegin(), a.cend(), output ); // display array a
22
23      // use iterators to swap elements at locations 0 and 1 of array a
24      iter_swap( a.begin(), a.begin() + 1 ); // swap with iterators    
25      cout << " Array a after swapping a[0] and a[1] using iter_swap:    ";
26      copy( a.cbegin(), a.cend(), output );
27
28      // swap elements in first five elements of array a with
29      // elements in last five elements of array a           
30      swap_ranges( a.begin(), a.begin() + 5, a.begin() + 5 );
31
32      cout << " Array a after swapping the first five elements "
33           << "with the last five elements:    ";
34      copy( a.cbegin(), a.cend(), output );
35      cout << endl;
36   } // end main