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

17 votes136 views6 answers
Array in c
C
0 vote142 views1 answer
Phpmyadmin export some errors have been detected
C
1 vote153 views1 answer
Length of string in c
C
-2 votes140 views1 answer
What does double mean in java
C
0 vote191 views1 answer
Deleting a word with copy fuction c code
C
0 vote141 views1 answer
Open cv
C
0 vote142 views1 answer
What is clrsce in C
C
1 vote144 views1 answer
Connect servo to arduino
C
0 vote138 views1 answer
Calling of a void in c
C
29 votes241 views6 answers
Online c compiler for graphics
C