std::stable_sort – cppreference.com

Aus cppreference.com

definiert in Header `<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)

Sortiert die Elemente im Bereich [first, last) in aufsteigender Reihenfolge. Die Reihenfolge der gleiche Elemente garantiert erhalten. Die erste Version verwendet operator< um die Elemente zu vergleichen, verwendet die zweite Version des gegebenen Vergleichsfunktion 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.

Parameter

first, last	-	der Bereich von Elementen zu sortieren 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`.

Rückgabewert

(None)

Original:

(none)

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

Komplexität

O(N·log²(N)), wo N = std::distance(first, last) Anwendungen cmp. Wenn zusätzlicher Speicher verfügbar ist, dann ist die Komplexität 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

Diese Funktion wird versucht, einen temporären Puffer die gleiche Größe wie die Sequenz, die sortiert, typischerweise durch Aufrufen std::get_temporary_buffer aufzuteilen. Wenn die Zuweisung fehlschlägt, wird die weniger effizienten Algorithmus gewählt .

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.

Beispiel

Siehe auch


	sortiert die ersten N Elementen einer Palette 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. (Funktions-Template) [edit]

	Sortiert einen Bereich in aufsteigender Reihenfolge 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. (Funktions-Template) [edit]