std::inplace_merge – cppreference.com

Aus cppreference.com

definiert in Header `<algorithm>`

`template< class BidirIt > void inplace_merge( BidirIt first, BidirIt middle, BidirIt last );`	(1)

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

Führt zwei aufeinanderfolgenden sortiert reicht [first, middle) und [middle, last) in einem sortierten Bereich [first, last). 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:

Merges two consecutive sorted ranges [first, middle) and [middle, last) into one sorted range [first, last). 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	-	der Beginn der ersten sortierten Bereich Original: the beginning of the first sorted range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
middle	-	das Ende der ersten sortierten Bereichs und dem Beginn des zweiten Original: the end of the first sorted range and the beginning of the second The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
last	-	das Ende des zweiten Bereichs sortiert Original: the end of the second sorted range 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 `BidirIt` can be dereferenced and then implicitly converted to both of them.
Type requirements
-`BidirIt` must meet the requirements of `ValueSwappable` and `BidirectionalIterator`.
-The type of dereferenced `BidirIt` 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

Genau N-1 Vergleiche, wenn genügend zusätzliche Speicher verfügbar ist, sonst N·log(N) wo N = std::distance(first, last) .

Original:

Exactly N-1 comparisons if enough additional memory is available, otherwise N·log(N) where N = std::distance(first, last).

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 versucht, einen temporären Puffer zuzuordnen, in der Regel durch den Aufruf std::get_temporary_buffer. Wenn die Zuweisung fehlschlägt, wird die weniger effizienten Algorithmus gewählt .

Original:

This function attempts to allocate a temporary buffer, 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

Der folgende Code ist eine Implementierung von Mergesort .

Original:

The following code is an implementation of merge sort.

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

#include <vector>
#include <iostream>
#include <algorithm>

template<class Iter>
void merge_sort(Iter first, Iter last)
{
    if (last - first > 1) {
        Iter middle = first + (last - first) / 2;
        merge_sort(first, middle);
        merge_sort(middle, last);
        std::inplace_merge(first, middle, last);
    }
}

int main()
{
    std::vector<int> v{8, 2, -2, 0, 11, 11, 1, 7, 3};
    merge_sort(v.begin(), v.end());
    for(auto n : v) {
        std::cout << n << ' ';
    }
    std::cout << '\n';
}

Output:

Siehe auch


merge	führt zwei sortierte reicht Original: merges two sorted ranges 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]

sort	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]

stable_sort	Arten eine Reihe von Elementen, während Aufrechterhaltung der Ordnung zwischen gleichen Elementen 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. (Funktions-Template) [edit]