# qsort

< c‎ | algorithm

C
 Langue Tapez soutien La gestion dynamique de la mémoire Erreur de manipulation Programme des services publics Utilitaires date et l'heure Bibliothèque cordes Algorithmes Numerics D'entrée / sortie de support Support de localisation Le support des threads (C11) Les opérations atomiques (C11)

Algorithmes
 qsort
 bsearch

 Defined in header void qsort( const void *ptr, size_t count, size_t size,             int (*comp)(const void *, const void *) );
Trie le tableau donné pointé par `ptr` dans l'ordre croissant. Le tableau contient des éléments `count` de `size` taille. Fonction pointée par `comp` est utilisé pour la comparaison d'objets .
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.

## Sommaire

### [modifier]Paramètres

 ptr - pointeur vers le tableau à trierOriginal: pointer to the array to sortThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. count - nombre d'éléments dans le tableauOriginal: number of element in the arrayThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. size - taille de chaque élément dans le tableau en octetsOriginal: size of each element in the array in bytesThe 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(const void *a, const void *b); The function must not modify the objects passed to it. ​

### [modifier]Retourne la valeur

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

### [modifier]Exemple

Le code suivant trie un tableau d'entiers en utilisant `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 <stdio.h>
#include <stdlib.h>

int compare_ints(const void* a, const void* b)
{
const int *arg1 = a;
const int *arg2 = b;

return *arg1 - *arg2;
}

int main(void)
{
int i;
int ints[] = { -2, 99, 0, -743, 2, 3, 4 };
int size = sizeof ints / sizeof *ints;

qsort(ints, size, sizeof(int), compare_ints);

for (i = 0; i < size; i++) {
printf("%d ", ints[i]);
}

printf("\n");

return EXIT_SUCCESS;
}```

Résultat :

`-743 -2 0 2 3 4 99`

### [modifier]Voir aussi

 bsearch recherche un tableau pour un élément de type non spécifiéOriginal: searches an array for an element of unspecified typeThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction)  C++ documentation for qsort