Алгоритм copy, back_inserter и vector

#include <iostream>
#include <algorithm>
#include <iterator>
 
#include <vector>
 
using namespace std;
 
int main()
{
    vector<int> coll{ 1, 2, 3, 4, 5 };
 
    copy(coll.begin(), coll.end(), ostream_iterator<int>(cout, " "));
    cout << endl;
    cout << coll.capacity() << endl;
 
    copy(coll.begin(), coll.end(), back_inserter(coll));
 
    copy(coll.begin(), coll.end(), ostream_iterator<int>(cout, " "));
    cout << endl;
    cout << coll.capacity() << endl;
 
}

#include <iostream>
#include <algorithm>
#include <iterator>
 
#include <vector>
 
using namespace std;
 
int main()
{
    vector<int> coll{ 1, 2, 3, 4, 5 };
 
    copy(coll.begin(), coll.end(), ostream_iterator<int>(cout, " "));
    cout << endl;
    cout << coll.capacity() << endl;
 
    auto it = coll.begin(), stop = coll.end();
    auto ins = back_inserter(coll);
    while (it != stop)
    {
        *ins = *it;
        ++ins;
        ++it;
    }
 
    copy(coll.begin(), coll.end(), ostream_iterator<int>(cout, " "));
    cout << endl;
    cout << coll.capacity() << endl;
}

template<class InputIt, class OutputIt>
OutputIt copy(InputIt first, InputIt last, 
              OutputIt d_first)
{
    while (first != last) {
        *d_first++ = *first++;
    }
    return d_first;
}

// [url]http://ru.cppreference.com/w/cpp/algorithm/copy[/url]
template<class InputIt, class OutputIt>
OutputIt copy(InputIt first, InputIt last,
              OutputIt d_first)
{
    while (first != last) 
    {
        *d_first++ = *first++;
    }
    return d_first;
}
//----------------------------------------------------------------------
// [url]http://en.cppreference.com/w/cpp/iterator/back_insert_iterator[/url]
template< class Container >
std::back_insert_iterator<Container> back_inserter( Container& c)
{
    return std::back_insert_iterator<Container>(c);
}
//----------------------------------------------------------------------
// Выдрано из MSVC 2010
template<class _Container>
    class back_insert_iterator
        : public _Outit
    {   // wrap pushes to back of container as output iterator
public:
    typedef back_insert_iterator<_Container> _Myt;
    typedef _Container container_type;
    typedef typename _Container::const_reference const_reference;
    typedef typename _Container::value_type _Valty;
 
    explicit back_insert_iterator(_Container& _Cont)
        : container(&_Cont)
        {   // construct with container
        }
 
    _Myt& operator=(const _Valty& _Val)
        {   // push value into container
        container->push_back(_Val);
        return (*this);
        }
 
    _Myt& operator=(_Valty&& _Val)
        {   // push value into container
        container->push_back(_STD forward<_Valty>(_Val));
        return (*this);
        }
 
    _Myt& operator*()
        {   // pretend to return designated value
        return (*this);
        }
 
    _Myt& operator++()
        {   // pretend to preincrement
        return (*this);
        }
 
    _Myt operator++(int)
        {   // pretend to postincrement
        return (*this);
        }
 
protected:
    _Container *container;  // pointer to container
    };

ptrdiff_t N = end - begin;
while(N!=0){
   //...
   --N;
}

#include <iostream>
#include <algorithm>
#include <iterator>
 
#include <list>
 
using namespace std;
 
int main()
{
    list<int> coll{ 1, 2, 3, 4, 5 };
 
    copy(coll.begin(), coll.end(), ostream_iterator<int>(cout, " "));
    cout << endl;
 
    copy(coll.begin(), coll.end(), back_inserter(coll));
 
    copy(coll.begin(), coll.end(), ostream_iterator<int>(cout, " "));
    cout << endl;
}

element = element->next;