Code for qsort in C with swap

/* qsort: sort v[left]...v[right] into increasing order */
void qsort(int v[], int left, int right)
{
    int i, last;

    if (left >= right) /* do nothing if array contains */
        return; /* fewer than two elements */

    swap(v, left, (left + right)/2); /* move partition elem */
    last = left;                     /* to v[0] */

    for (i = left + 1; i <= right; i++) /* partition */
        if (v[i] < v[left])
            swap(v, ++last, i);
    swap(v, left, last); /* restore partition elem */
    qsort(v, left, last-1);
    qsort(v, last+1, right);
}

/* swap: interchange v[i] and v[j] */
void swap(int v[], int i, int j)
{
    int temp;
    temp = v[i];
    v[i] = v[j];
    v[j] = temp;
}

Source: stackoverflow.com

Similar codes

0 vote307 views1 answer
Remplir list Java rapidemnet
C
0 vote330 views1 answer
C percentage program
C
29 votes450 views6 answers
Online c compiler for graphics
C
0 vote322 views2 answers
Params in main function in C
C
1 vote319 views1 answer
How to pass an array of structs as an argument in c
C
0 vote310 views1 answer
Redis as a service
C
0 vote321 views1 answer
Libraries that are not supported by null sound safety in flutter
C
4 votes327 views3 answers
Fibbonacci series
C
2 votes316 views1 answer
C union in struct
C
1 vote325 views2 answers
Arduino ip to string
C