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

3 votes200 views1 answer
Circle around icon flutter
C
0 vote194 views4 answers
Coin row problem calculator
C
0 vote211 views1 answer
Function of science writing of a number
C
0 vote213 views1 answer
Algorithm that flips sentences and numbers
C
39 votes518 views4 answers
Celsius to fahrenheit formula
C
7 votes214 views3 answers
How to reverse a string in c
C
4 votes200 views1 answer
C minor diminished
C
0 vote217 views1 answer
Pointer parameter where to put the asterix in C?
C
0 vote208 views1 answer
Vbnet create and write on file
C
9 votes220 views1 answer
How to genrate a random number in C
C