std::stable_sort
De cppreference.com
![]() | This page has been machine-translated from the English version of the wiki using Google Translate. The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
Definido en la cabecera <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) | |
Ordena los elementos de la
[first, last)
rango en orden ascendente. El orden de los elementos iguales se garantiza que se conservan. La primera versión utiliza operator< para comparar los elementos, la segunda versión utiliza la función de comparación dado 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.
You can help to correct and verify the translation. Click here for instructions.
Contenido |
[editar]Parámetros
first, last | - | la gama de elementos a ordenar 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. |
Requerimientos de tipo | ||
-RandomIt debe reunir los requerimientos de ValueSwappable y RandomAccessIterator . | ||
-The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible . |
[editar]Valor de retorno
(Ninguno)
Original:
(none)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[editar]Complejidad
O(N·log2(N)), donde las aplicaciones N =std::distance(first, last) de
cmp
. Si la memoria adicional está disponible, la complejidad es O(N·log(N) .Original:
O(N·log2(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.
You can help to correct and verify the translation. Click here for instructions.
[editar]Notas
Esta función intenta asignar una memoria intermedia temporal igual en tamaño a la secuencia a ser ordenados, normalmente llamando std::get_temporary_buffer. Si la asignación falla, el algoritmo menos eficiente es elegido .
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.
You can help to correct and verify the translation. Click here for instructions.
[editar]Ejemplo
Esta sección está incompleta Razón: sin ejemplo |
[editar]Ver también
ordena los primeros n elementos de un rango 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. (plantilla de función) | |
Ordena un intervalo en orden ascendente 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. (plantilla de función) |