std::qsort – cppreference.com
Aus cppreference.com
<metanoindex/>
<tbody> </tbody>
| definiert in Header <cstdlib> |
||
|
|
||
Sortiert die angegebene Array, auf das ptr in aufsteigender Reihenfolge. Das Array enthält count Elemente der Größe size. Funktion, auf die comp ist für Objekt Vergleich herangezogen .
Original:
Sorts the given array pointed to by ptr in ascending order. The array contains count elements of size size. Function pointed to by comp is used for object comparison.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Parameter
| ptr | - | Zeiger auf das Array zu sortieren Original: pointer to the array to sort The text has been machine-translated via Google Translate. |
| count | - | Zahl der Element in dem Array Original: number of element in the array The text has been machine-translated via Google Translate. |
| size | - | Größe der einzelnen Elemente in dem Array in Bytes Original: size of each element in the array in bytes The text has been machine-translated via Google Translate. |
| comp | - | comparison function which returns a negative integer value if the first argument is less than the second,
a positive integer value if the first argument is greater than the second and zero if the arguments are equal.
The function must not modify the objects passed to it. |
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.
Notes
Der Typ der Elemente des Arrays muss ein trivial Typ sein, da sonst das Verhalten undefiniert ist .
Original:
The type of the elements of the array must be a trivial type, otherwise the behavior is undefined.
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 sortiert ein Array von Ganzzahlen mit qsort() .
Original:
The following code sorts an array of integers using qsort().
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
#include <iostream> #include <cstdlib> int compare_ints(const void* a, const void* b) // comparison function { int* arg1 = (int*) a; int* arg2 = (int*) b; if (*arg1 < *arg2) return -1; else if (*arg1 == *arg2) return 0; else return 1; } int main() { int a[] = { -2, 99, 0, -743, 2, 3, 4 }; int size = 7; std::qsort(a, size, sizeof(int), compare_ints); for (int i = 0; i < size; i++) { std::cout << a[i] << " "; } std::cout << '\n'; }
Output:
Siehe auch
durchsucht eine Anordnung für ein Element des angegebenen Typ Original: searches an array for an element of unspecified type The text has been machine-translated via Google Translate. (Funktion) [edit] | |
Sortiert einen Bereich in aufsteigender Reihenfolge Original: sorts a range into ascending order The text has been machine-translated via Google Translate. (Funktions-Template) [edit] | |
(C++11) |
prüft, ob ein Typ ist trivial Original: checks if a type is trivial The text has been machine-translated via Google Translate. (Klassen-Template) [edit] |
C documentation for qsort | |