Trier le contenu d’une collection avec l’algorithme ‘partial_sort()’

Author:

 vecteur, iterator
Download


#include 
#include 
#include 
#include 
#include 
using namespace std;

template 
inline void inserer_elements (T& coll, int first, int last)
{
    for (int i=first; i<=last; ++i) {
        coll.insert(coll.end(),i);
    }
}

int main()
{
    vector vec;
    ostream_iterator output(cout," ");
    inserer_elements(vec,12,18);
    inserer_elements(vec, 8, 21);

	cout<<"Le contenu du vector: ";
    copy(vec.begin(), vec.end(), output);
    cout<
    

Leave a Reply

Your email address will not be published. Required fields are marked *