Using an in-place generic sort algorithm : sort « STL Algorithms Sorting « C++

1.	Bitset
2.	Class
3.	Console
4.	Data Structure
5.	Data Type
6.	Deque
7.	Development
8.	File
9.	Function
10.	Generic
11.	Language
12.	List
13.	Map Multimap
14.	Overload
15.	Pointer
16.	Qt
17.	Queue Stack
18.	Set Multiset
19.	STL Algorithms Binary search
20.	STL Algorithms Heap
21.	STL Algorithms Helper
22.	STL Algorithms Iterator
23.	STL Algorithms Merge
24.	STL Algorithms Min Max
25.	STL Algorithms Modifying sequence operations
26.	STL Algorithms Non modifying sequence operations
27.	STL Algorithms Sorting
28.	STL Basics
29.	String
30.	Valarray
31.	Vector

C / ANSI-C

C Tutorial

C++ Tutorial

Visual C++ .NET

C++ » STL Algorithms Sorting » sort

Screenshots

Using an in-place generic sort algorithm

  

 

#include <iostream>

#include <algorithm>

#include <cassert>

using namespace std;



int main() {

  int a[1000];

  int i;

  

  for (i = 0; i < 1000; ++i) 

    a[i] = 1000 - i - 1;



  sort(&a[0], &a[1000]);



  for (i = 0; i < 1000; ++i) 

    assert (a[i] == i);

  

  return 0;

}

Related examples in the same category

1.	Sort a vector and print out the sorted elements
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()

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.