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 vote313 views2 answers
Command args c
C
0 vote194 views1 answer
Time random c
C
-1 vote189 views2 answers
Printf n characters c
C
18 votes197 views2 answers
C concatenate and allocate string
C
0 vote190 views1 answer
A binary tree whose every node has either zero or two children is called
C
0 vote241 views1 answer
System(color )
C
0 vote232 views3 answers
Bfs
C
0 vote198 views1 answer
California
C
1 vote191 views1 answer
Dynamically create matrix c
C
0 vote230 views1 answer
Write a 64-bit program in assembly that prints Hello, world in .asm
C