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

15 votes276 views2 answers
Boolean in c
C
1 vote226 views1 answer
Grepper vscodium
C
12 votes229 views2 answers
Install *.deb file in ubuntu
C
1 vote238 views1 answer
Roshan Kumar
C
0 vote267 views1 answer
Graphics in C
C
0 vote255 views1 answer
Resto de division recursiva
C
0 vote285 views1 answer
C how to check a palindrome string
C
0 vote257 views1 answer
Apt-mark remove hold
C
1 vote215 views1 answer
Stdio
C
0 vote241 views1 answer
Flip exis in dataframe
C