std::partial_sort - cppreference.com

De cppreference.com

Definido no cabeçalho `<algorithm>`

`template< class RandomIt > void partial_sort( RandomIt first, RandomIt middle, RandomIt last );`	(1)

`template< class RandomIt, class Compare > void partial_sort( RandomIt first, RandomIt middle, RandomIt last, Compare comp );`	(2)

Classifica alguns dos elementos no intervalo [first, last) em ordem ascendente. O middle - first primeiro destes elementos são colocados na [first, middle) gama. A ordem dos elementos iguais não é garantido para ser preservado. A ordem dos elementos restantes na [middle, last) intervalo é indeterminado. 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 some of the elements in the range [first, last) in ascending order. The first middle - first of these elements are placed in the range [first, middle). The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range [middle, last) is unspecified. 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.

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. The types `Type1` and `Type2` must be such that an object of type `RandomIt` can be dereferenced and then implicitly converted to both of them.
Type requirements
-`RandomIt` must meet the requirements of `ValueSwappable` and `RandomAccessIterator`.
-The type of dereferenced `RandomIt` must meet the requirements of `MoveAssignable` and `MoveConstructible`.

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.

Complexidade

O(N·log²(N)), onde as aplicações N = std::distance(first, last) de cmp. Se a memória adicional está disponível, então a complexidade é O(N·log(N))

Original:

O(N·log²(N)), where N = std::distance(first, last) applications of cmp. If additional memory is available, then the complexity is O(N·log(N))

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

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::partial_sort(s.begin(), s.begin() + 3, s.end());
    for (int a : s) {
        std::cout << a << " ";
    } 
}

Saída:

Veja também


partial_sort_copy	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) [edit]

stable_sort	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) [edit]

sort	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) [edit]