Sort part of the elements in an array : sort « STL Algorithms Sorting « C++ Tutorial






  1. C++ Tutorial
  2. STL Algorithms Sorting
  3. sort
/* 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 <algorithm>
#include <functional>
#include <iterator>
using namespace std;

int main()
{
    int coll[] = { 5, 6, 2, 4, 1, 3 };

    // sort beginning with the second element
    sort (coll+3, coll+6);

    // print all elements
    copy (coll, coll+6,ostream_iterator<int>(cout," "));
    cout << endl;
}

5 6 2 1 3 4




27.1.sort
27.1.1.Using an in-place generic sort algorithm
27.1.2.Sort a vector and print out the sorted elements
27.1.3.Sort all element in an array
27.1.4.Sort part of the elements in an array
27.1.5.Sort a vector into ascending order of id members
27.1.6.Sort elements in deque
27.1.7.Sort elements reversely with custom function
27.1.8.Using the generic sort algorithm with a binary predicate: greater
27.1.9.Use custom function and sort to sort strings by length