Sort a vector and print out the sorted elements

  
 

/* The following code example is taken from the book
 * "The C++ Standard Library - A Tutorial and Reference"
 * by Nicolai M. Josuttis, Addison-Wesley, 1999
 *
 * (C) Copyright Nicolai M. Josuttis 1999.
 * Permission to copy, use, modify, sell and distribute this software
 * is granted provided this copyright notice appears in all copies.
 * This software is provided "as is" without express or implied
 * warranty, and with no claim as to its suitability for any purpose.
 */
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    vector<int> coll;
    vector<int>::iterator pos;

    // insert elements from 1 to 6 in arbitrary order
    coll.push_back(2);
    coll.push_back(5);
    coll.push_back(4);
    coll.push_back(1);
    coll.push_back(6);
    coll.push_back(3);

    // sort all elements
    sort (coll.begin(), coll.end());

    // print all elements
    for (pos=coll.begin(); pos!=coll.end(); ++pos) {
        cout << *pos << ' ';
    }

}

 /* 
1 2 3 4 5 6 
 */

Related examples in the same category

1.	Using an in-place generic sort algorithm
2.	Sort all element in an array
3.	Sort part of the elements in an array
4.	Sort a vector into ascending order of id members
5.	Sort elements in deque
6.	Sort elements reversely with custom function
7.	Using the generic sort algorithm with a binary predicate: greater
8.	Use custom function and sort to sort strings by length
9.	Sorting user-defined class
10.	Sort the entire container
11.	Sort into descending order by using greater
12.	Sort a subset of the container
13.	Sort random number
14.	Sort a string array with sort()

Sort a vector and print out the sorted elements : sort « STL Algorithms Sorting « C++

Related examples in the same category