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 vote212 views1 answer
C program to find minimum of 4 numbers using conditional operator in c
C
0 vote191 views1 answer
Android studio sdkmanager always accept
C
0 vote170 views5 answers
Online c compiler with mpi
C
0 vote191 views1 answer
Program optimization
C
0 vote181 views1 answer
Printf hex
C
0 vote191 views1 answer
Geom boxplot remove outliers
C
0 vote188 views1 answer
Call cuda kernel from c parameters
C
0 vote201 views2 answers
How to read in sentences in c
C
5 votes263 views4 answers
Div same line
C
0 vote187 views2 answers
Convert calendar time to epoch in c programming
C