Sort a list. : List « Data Structure « C++

1. C++
2. Data Structure
3. List

Sort a list.

#include <iostream>
#include <list>
#include <cstdlib>
using namespace std;

int main()
{
  list<int> listObject;
  int i;

  for(i = 0; i < 10; i++)
    listObject.push_back(rand());

  cout << "Original contents:\n";
  list<int>::iterator p = listObject.begin();
  while(p != listObject.end()) {
    cout << *p << " ";
    p++;
  }
  cout << endl << endl;


  listObject.sort();
  
  cout << "Sorted contents:\n";
  p = listObject.begin();
  while(p != listObject.end()) {
    cout << *p << " ";
    p++;
  }
  
  return 0;
}


           
       

Related examples in the same category

1.	List basics: push, begin, end pop
2.	Elements can be put on the front or end of a list.
3.	Define class and store in a list
4.	An example of the transform algorithm.
5.	Demonstrate merge() in list
6.	Merging won't work if the lists aren't ordered.
7.	Merge into descending order.
8.	A list splicing example.
9.	Demonstrate remove() in list
10.	Demonstrate unique() in list
11.	Using reverse() to create a palindrome tester.
12.	Using a list to store mailing addresses.
13.	Use ostream_iterator for string
14.	Demonstrate advance() and distance() in list
15.	Using an arrays as a container
16.	Using a list: push_back, begin, end, size
17.	Merge and splice lists.
18.	Copy a list to a vector.
19.	Push value in the list
20.	Use a binary function object in list 'transform'
21.	end() in list.
22.	The difference between push_back() and push_front().
23.	Merge two lists.
24.	Store class objects in a list.
25.	Transform algorithm based on list.
26.	Demonstrate bind2nd().
27.	Create a reciprocal function object.
28.	Understanding end() in List
29.	Difference between push_back() and push_front()
30.	Merging One List with Another
31.	Storing Class Objects in a List
32.	Traverse a List Using an Iterator
33.	Demonstrate virtual functons: list interface