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 vote217 views1 answer
Counting Sort C
C
0 vote219 views1 answer
C static
C
0 vote232 views1 answer
Symmetrical matrix in C
C
3 votes230 views4 answers
Clear screen in c
C
1 vote215 views1 answer
Difference between malloc and calloc and realloc
C
0 vote241 views2 answers
Man strstr
C
2 votes212 views2 answers
Increment and decrement operator
C
-2 votes318 views2 answers
C code to algorithm converter online
C
0 vote223 views1 answer
Inserting array
C
2 votes200 views2 answers
Prototype pollution
C