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

2 votes161 views1 answer
Animated sprite from few images pygame
C
0 vote161 views1 answer
What keyword covers unhandled possibilities?
C
3 votes146 views2 answers
Fread
C
0 vote243 views1 answer
Pre and post increment in c
C
1 vote159 views1 answer
Class in oops
C
0 vote160 views1 answer
Rust set toolchain
C
0 vote166 views1 answer
OpenDaylight maven settings
C
1 vote162 views2 answers
Slack wordpress
C
1 vote177 views1 answer
Dynamic 2d arr in c
C
0 vote165 views1 answer
C long to string
C