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

1 vote221 views2 answers
Define constant c
C
-1 vote212 views2 answers
C tutorials
C
0 vote249 views1 answer
Gsl matrix invert
C
0 vote155 views1 answer
What is stdin fd number
C
0 vote203 views1 answer
UTC offset upper limit
C
0 vote210 views1 answer
How to pass a struct value to a pthread in c?
C
0 vote319 views1 answer
Largest value in u16
C
2 votes238 views1 answer
Pygame draw transparent rectangle
C
0 vote218 views2 answers
Couldn't be accessed by user '_apt'. - pkgAcquire::Run
C
19 votes210 views6 answers
Mongodb delete all documents
C