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

4 votes169 views1 answer
Best switch game
C
0 vote177 views1 answer
Retoure a la ligne C
C
0 vote163 views1 answer
Rust cross compile
C
0 vote155 views1 answer
Read a document in c getting name from console
C
0 vote178 views1 answer
Bcd to char c
C
3 votes191 views1 answer
Insert random numbers in excel
C
0 vote154 views1 answer
Check command line input is a number in c
C
0 vote124 views1 answer
Yt derived field
C
0 vote196 views1 answer
C first digit of integer
C
1 vote157 views1 answer
Round function in C
C