std::iter_swap

From cppreference.com
 
 
 
Defined in header <algorithm>
template< class ForwardIterator1, class ForwardIterator2 >
void iter_swap( ForwardIterator1 a, ForwardIterator2 b );

Swaps the values of the elements the given iterators are pointing to.

Contents

[edit] Parameters

a, b - iterators to the elements to swap

[edit] Return value

(none)

[edit] Complexity

constant

[edit] Possible implementation

[edit] Example

The following is an implementation of selection sort in C++

#include <random>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <iterator>
 
template<class ForwardIterator>
void selection_sort(ForwardIterator begin, ForwardIterator end)
{
    for(ForwardIterator i = begin; i != end; ++i)
        std::iter_swap(i, std::min_element(i, end));
}
 
int main()
{
    std::random_device rd;
    std::mt19937 gen(rd());
    std::uniform_int_distribution<> dist(-10, 10);
    std::vector<int> v;
    generate_n(back_inserter(v), 20, bind(dist, gen));
 
    std::cout << "Before sort: ";
    copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " "));
 
    selection_sort(v.begin(), v.end());
 
    std::cout << "\nAfter sort: ";
    copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " "));
    std::cout << '\n';
}

Output:

Before sort: -7 6 2 4 -1 6 -9 -1 2 -5 10 -9 -5 -3 -5 -3 6 6 1 8
After sort: -9 -9 -7 -5 -5 -5 -3 -3 -1 -1 1 2 2 4 6 6 6 6 8 10

[edit] See also

swaps the values of two objects
(function template)
swaps two ranges of elements
(function template)