Illustrating the generic nth_element algorithm : nth_element « STL Algorithms Sorting « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Sorting » nth_element

27.7.1.Illustrating the generic nth_element algorithm

#include <iostream>

#include <cassert>

#include <algorithm>

#include <vector>

using namespace std;



int main()

{

  vector<int> v(7);



  v[0] = 25; 

  v[1] = 7; 

  v[2] = 9;

  v[3] = 2; 

  v[4] = 0; 

  v[5] = 5; 

  v[6] = 21;



  const int N = 4;



  // Use nth_element to place the Nth smallest 

  // element in v in the Nth position, v.begin() + N:



  nth_element(v.begin(), v.begin() + N, v.end());

  

  for (int i = 0; i < N; ++i)

    assert (v[N] >= v[i]);

  

  for (int i = N + 1; i < 7; ++i)

     cout << v[N];



  return 0;

}

27.7.nth_element
	27.7.1.	Illustrating the generic nth_element algorithm
	27.7.2.	Use nth_element to extract the four lowest elements
	27.7.3.	Use nth_element to extract the four highest elements
	27.7.4.	Use nth_element with custom function to extract the four highest elements

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.