std::sort
来自cppreference.com
![]() |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
Defined in header <algorithm>
|
||
template< class RandomIt > void sort( RandomIt first, RandomIt last ); |
(1) | |
template< class RandomIt, class Compare > void sort( RandomIt first, RandomIt last, Compare comp ); |
(2) | |
范围
[first, last)
中的元素进行排序按升序排列。要保留相等元素的顺序是不能保证。 operator<的第一个版本使用比较的元素,第二个版本使用给定的比较函数comp
.Original:
Sorts the elements in the range
[first, last)
in ascending order. The order of equal elements is not guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp
.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
目录 |
[编辑] 参数
first, last | - | 范围内的元素进行排序
Original: the range of elements to sort The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. | |||||||||
comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. | |||||||||
Type requirements | |||||||||||
-RandomIt must meet the requirements of ValueSwappable and RandomAccessIterator .
| |||||||||||
-The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible .
|
[编辑] 返回值
(无)
Original:
(none)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[编辑] 复杂性
O(N·log(N)),N = std::distance(first, last)应用
cmp
.Original:
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[编辑] 为例
#include <algorithm> #include <functional> #include <array> #include <iostream> int main() { std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3}; std::sort(s.begin(), s.end()); for (int a : s) { std::cout << a << " "; } std::cout << '\n'; std::sort(s.begin(), s.end(), std::greater<int>()); for (int a : s) { std::cout << a << " "; } std::cout << '\n'; }
Output:
0 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1 0
[编辑] 另请参阅
排序第一的范围内的N个元素 Original: sorts the first N elements of a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (函数模板) | |
排序范围内的元素,同时保持相等的元素之间的顺序 Original: sorts a range of elements while preserving order between equal elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (函数模板) |