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

24 votes229 views6 answers
MongoDb delete
C
0 vote222 views1 answer
Bool c++
C
0 vote214 views1 answer
Stdin char c
C
0 vote215 views1 answer
Reset c array to zero
C
1 vote226 views3 answers
C |= operator
C
0 vote204 views1 answer
Molotovn't ribbentropn't pact
C
0 vote224 views1 answer
Futter Square Button
C
1 vote189 views1 answer
Stdio
C
1 vote221 views1 answer
Open a file in from terminal
C
0 vote148 views1 answer
Passing an array of unspecified number of variables to a function
C