std::sort
Da 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. |
Definido no cabeçalho <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) | |
Classifica os elementos no
[first, last) intervalo em ordem crescente. A ordem dos elementos iguais não é garantido para ser preservado. A primeira versão utiliza operator< para comparar os elementos, a segunda versão utiliza a função de comparação dada 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.
Índice |
[editar]Parâmetros
| first, last | - | a gama de elementos para classificar 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: bool cmp(const Type1 &a, const Type2 &b); 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. | ||
[editar]Valor de retorno
(Nenhum)
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.
[editar]Complexidade
O(N·log(N)), onde as aplicações N =std::distance(first, last) de
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.
[editar]Exemplo
#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';}
Saída:
0 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1 0
[editar]Veja também
classifica os elementos N primeiros de uma série 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. (modelo de função) | |
Classifica um intervalo de elementos preservando ordem entre elementos iguais 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. (modelo de função) | |
