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 vote249 views1 answer
Keep last n bits
C
0 vote268 views1 answer
How to search in a file in c
C
8 votes266 views3 answers
Bootstrap form template
C
0 vote245 views1 answer
Powershell some fonts like #include are dissapearing
C
2 votes250 views1 answer
Arduino digital read
C
4 votes257 views2 answers
Create empty vector in rust
C
0 vote274 views1 answer
FIRST PROGRAM IN C
C
3 votes285 views1 answer
How to compareTo in java
C
0 vote265 views1 answer
Socket only connection
C
0 vote248 views1 answer
Nested switch case in c
C