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 vote277 views1 answer
Program to check whether the number is prime or not in java
C
0 vote245 views1 answer
Yum install supervisor amazon linux
C
0 vote256 views1 answer
How to check a condition using one line in c
C
2 votes254 views1 answer
Arduino digital input pins
C
22 votes252 views2 answers
C str add int
C
0 vote265 views1 answer
Count number of vowels in a string in c
C
1 vote249 views1 answer
Round function in C
C
0 vote263 views1 answer
Choose random number with weight
C
0 vote242 views1 answer
What is wrong with this in c
C
-1 vote266 views1 answer
Typecast Operator in C language
C