Swap elements at locations 0 and 1 of an array : swap « STL Algorithms Modifying sequence operations « C++






  1. C++
  2. STL Algorithms Modifying sequence operations
  3. swap

Swap elements at locations 0 and 1 of an array

 
 

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

#include <algorithm>
#include <iterator>

int main()
{
   int a[ 10 ] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
   std::ostream_iterator< int > output( cout, " " );

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

   
   std::swap( a[ 0 ], a[ 1 ] );

   cout << "\nArray a after swapping a[0] and a[1] using swap:\n   ";
   std::copy( a, a + 10, output ); // display array a

   cout << endl;
   return 0;
}

/* 
Array a contains:
   1 2 3 4 5 6 7 8 9 10
Array a after swapping a[0] and a[1] using swap:
   2 1 3 4 5 6 7 8 9 10

 */








Related examples in the same category

1.Illustrating the generic swap algorithm: swap two integers
2.Illustrating the generic swap algorithm
3.Swap second and fourth element in a vector