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 vote200 views1 answer
Entering raw mode
C
10 votes242 views9 answers
Material ui
C
0 vote185 views1 answer
How to make a multiline string in C
C
0 vote200 views1 answer
Class to const void *
C
0 vote231 views1 answer
D3 box shadow
C
2 votes218 views1 answer
How to install npm in alpine linux
C
6 votes205 views2 answers
Print an array in c
C
2 votes188 views1 answer
How to modulo decimal c
C
0 vote185 views3 answers
Variadic macros in c
C
3 votes229 views2 answers
Volatile keyword in c
C