std::nth_element
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 nth_element( RandomIt first, RandomIt nth, RandomIt last ); |
(1) | |
| template< class RandomIt, class Compare > void nth_element( RandomIt first, RandomIt nth, RandomIt last, Compare comp ); |
(2) | |
Parcialmente classifica a
[first, last) intervalo em ordem crescente, de modo que todos os elementos da gama [first, nth) são' menos do que aqueles na faixa [nth, last). A primeira versão utiliza operator< para comparar os elementos, a segunda versão utiliza o comp dada função de comparação. O elemento colocado na posição nth é exactamente o elemento que iria ocorrer nesta posição, se o intervalo de variação foi totalmente resolvido.Original:
Partially sorts the range
[first, last) in ascending order so that all elements in the range [first, nth) are less than those in the range [nth, last). The first version uses operator< to compare the elements, the second version uses the given comparison function comp. The element placed in the nth position is exactly the element that would occur in this position if the range was fully sorted.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 | - | aleatórios iteradores de acesso que definem o tipo intervalo
Original: random access iterators defining the range sort The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| nth | - | iterador de acesso aleatório a definição do ponto de partição tipo
Original: random access iterator defining the sort partition point 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
Linear em std::distance(first, last) em média.
Original:
Linear in std::distance(first, last) on average.
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 <iostream> #include <vector> #include <algorithm> #include <functional> int main() { std::vector<int> v{5, 6, 4, 3, 2, 6, 7, 9, 3}; std::nth_element(v.begin(), v.begin() + v.size()/2, v.end()); std::cout << "The median is " << v[v.size()/2] << '\n'; std::nth_element(v.begin(), v.begin()+1, v.end(), std::greater<int>()); std::cout << "The second largest element is " << v[1] << '\n'; }
Saída:
The median is 5 The second largest element is 7
[editar] Veja também
| cópias e parcialmente Classifica um intervalo de elementos Original: copies and partially sorts a range of 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) | |
| 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) | |
| tipo um intervalo em ordem crescente Original: sorts a range into ascending order 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) | |
