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

3 votes122 views2 answers
Gcc compiler for windows 10
C
4 votes142 views1 answer
How to print value of pointer in c
C
1 vote153 views1 answer
Remove first character from string c
C
0 vote144 views1 answer
Wait until an animation finishes - Selenium, Java
C
0 vote123 views6 answers
C program boilerplate
C
0 vote132 views1 answer
Python adding calculator
C
2 votes127 views1 answer
Square in c
C
0 vote158 views1 answer
Strlen stop before '\0' or at
C
0 vote119 views1 answer
Print command for rust unit-test
C
7 votes96 views2 answers
How to press enter in selenium
C