Exemple d’utilisation de l’algorithme ‘partial_sort_copy()’ avec une fonction de comparaison

Author:

 deque, vecteur, iterator
Download

#include 
#include 
#include 
#include 
#include 
#include 

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

using namespace std;

int main()
{
    deque deq;
    ostream_iterator output(cout," ");

    inserer_elements(deq,-9,-2);
    inserer_elements(deq,-22,-18);
    inserer_elements(deq,8,13);

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

    vector::iterator pos;
    pos = partial_sort_copy (deq.begin(), deq.end(),
                               vec.begin(), vec.end(),
                               greater());

	 cout<<"Le contenu du vecteur: ";
    copy (vec.begin(), pos,
          ostream_iterator(cout," "));
    cout << endl;

	return 0;
}

Leave a Reply

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