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 vote202 views1 answer
Passing an array to a function
C
0 vote215 views1 answer
Recursion function bangla
C
2 votes204 views1 answer
Mirzapur 2 release date and time
C
0 vote193 views1 answer
What is stdin fd number
C
1 vote181 views1 answer
Default font for material ui
C
0 vote233 views1 answer
E sharm card jobkhozo.com
C
0 vote260 views1 answer
Epita
C
0 vote228 views1 answer
1000000000
C
0 vote284 views1 answer
Firebase Connecting with ESP8266
C
2 votes233 views1 answer
Curl cpp
C