std::qsort

 

C++

Linguagem

Conceitos

Biblioteca de utilitários

Biblioteca cordas

Recipientes biblioteca

Biblioteca algoritmos

Biblioteca iteradores

Biblioteca numéricos

De entrada / saída da biblioteca

Biblioteca localizações

Biblioteca de expressões regulares(C++11)

Biblioteca operações atômica(C++11)

Biblioteca de suporte a discussão(C++11)

 

Biblioteca algoritmo

Funções Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Não modificar operações de seqüência Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modificando operações de seqüência Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Particionamento operações Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Operações de classificação (em intervalos ordenados) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binários operações de busca (em intervalos ordenados) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Definir operações (em intervalos ordenados) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Operações de pilha Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Mínimo / máximo de operações Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Operações numéricas Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C biblioteca Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <cstdlib>
void qsort(constvoid*ptr, size_t count, size_t size,             int(*comp)(constvoid*, constvoid*));

Classifica a matriz dado apontado por ptr em ordem crescente. A matriz contém elementos count de size tamanho. Função apontada pelo comp é usado para comparação de objetos.

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.

Parâmetros

ptr	-	ponteiro para a matriz para classificar Original: pointer to the array to sort The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
count	-	número de elementos na matriz Original: number of element in the array The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
size	-	tamanho de cada elemento na matriz em bytes Original: size of each element in the array in bytes 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 ​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 signature of the comparison function should be equivalent to the following:  int cmp(constvoid*a, constvoid*b); The function must not modify the objects passed to it. ​

Valor de retorno

(Nenhum)

Original:

(none)

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

Notas

O tipo dos elementos da matriz deve ser um tipo de' trivial, caso contrário, o comportamento é indefinido.

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.

Exemplo

Os seguintes tipos de código de um array de inteiros usando 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(constvoid* a, constvoid* b)// comparison function{int* arg1 =(int*) a;int* arg2 =(int*) b;if(*arg1 <*arg2)return-1;elseif(*arg1 ==*arg2)return0;elsereturn1;}   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:

-743 -2 0 2 3 4 99

Veja também

bsearch	procura uma matriz para um elemento de tipo não especificado Original: searches an array for an element of unspecified type The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (função)
sort	tipo um intervalo em ordem crescente 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. (modelo de função)
is_trivial (C++11)	verifica se um tipo é trivial Original: checks if a type is trivial The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de classe)
C documentation for qsort