std::stable_sort — cppreference.com

De cppreference.com

Déclaré dans l'en-tête `<algorithm>`
`template< class RandomIt > void stable_sort( RandomIt first, RandomIt last );`	(1)
`template< class RandomIt, class Compare > void stable_sort( RandomIt first, RandomIt last, Compare comp );`	(2)

Trie les éléments dans l'[first, last) plage dans l'ordre croissant. L'ordre des éléments égaux est assuré d'être préservé. La première version utilise operator< de comparer les éléments, la deuxième version utilise la fonction de comparaison donnée comp .

Original:

Sorts the elements in the range [first, last) in ascending order. The order of equal elements is 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.

Paramètres

first, last	-	la plage d'éléments à trier 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`.

Retourne la valeur

(Aucun)

Original:

(none)

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

Complexité

O(N·log²(N)), où les applications N = std::distance(first, last) de cmp. Si la mémoire supplémentaire est disponible, alors la complexité est 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.

Notes

Cette fonction tente d'allouer une mémoire tampon temporaire de taille égale à la séquence à trier, généralement en appelant std::get_temporary_buffer. Si l'allocation échoue, l'algorithme moins efficace est choisi .

Original:

This function attempts to allocate a temporary buffer equal in size to the sequence to be sorted, typically by calling std::get_temporary_buffer. If the allocation fails, the less efficient algorithm is chosen.

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

Exemple

Voir aussi


	trie les n premiers éléments d'une gamme 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. (fonction générique) [edit]

	trie une plage dans l'ordre ascendant 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. (fonction générique) [edit]