Home
C++ Tutorial
Language Basics
Data Types
Operators statements
Array
Development
Exceptions
Function
Structure
Class
Operator Overloading
Pointer
File Stream
template
STL Introduction
string
vector
list
bitset
set multiset
valarray
queue stack
deque
map multimap
STL Algorithms Modifying sequence operations
STL Algorithms Non modifying sequence operations
STL Algorithms Binary search
STL Algorithms Sorting
STL Algorithms Merge
STL Algorithms Min Max
STL Algorithms Iterator
STL Algorithms Heap
STL Algorithms Helper
partial_sort « STL Algorithms Sorting « C++ Tutorial
C++ Tutorial
STL Algorithms Sorting
partial_sort
27.5.partial_sort
27.5.1.
Use partial_sort to sort until the first five elements are sorted
27.5.2.
Use partial_sort with custom function to sort inversely until the first five elements are sorted
27.5.3.
Use partial_sort to sort all elements
27.5.4.
The generic partial_sort algorithms with predicate