qsort

Template:c/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <stdlib.h>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td class="t-dcl-nopad">

void qsort( const void *ptr, size_t count, size_t size,
            int (*comp)(const void *, const void *) );

</td>

<td class="t-dcl-nopad"> </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

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.

Parameters

ptr	-	pointer to the array to sort
count	-	number of element in the array
size	-	size of each element in the array in bytes
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 equivalent. 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 and must return consistent results when called for the same objects, regardless of their positions in the array. ​

Return value

(none)

Example

The following code sorts an array of integers using qsort()

Run this code

#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;
}

Output:

-743 -2 0 2 3 4 99

See also

Template:c/algorithm/dcl list bsearch

C++ documentation for qsort