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 vote282 views1 answer
Arduino client disconnect
C
1 vote271 views1 answer
Rename c
C
0 vote297 views1 answer
Resto de division recursiva
C
1 vote239 views1 answer
Stdio
C
10 votes252 views2 answers
Linux sleep with exec /bin/sleep
C
0 vote264 views1 answer
Variable in c
C
2 votes252 views6 answers
How to print hello world in c
C
0 vote270 views1 answer
Maximum, minimum, mean, and median of the data set. in array c programming
C
0 vote275 views1 answer
Uri/Beecrowd problem no - 1151 solution in C
C
2 votes250 views2 answers
C clear buffer
C