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

1 vote352 views1 answer
How to install vscode extension manually
C
3 votes378 views1 answer
Fast inverse square root explained
C
0 vote437 views3 answers
Swap two numbers in c
C
0 vote326 views1 answer
Postgres random choice
C
-3 votes459 views1 answer
Uri/beecrowd problem no - 1133 solution in C
C
39 votes592 views5 answers
Fahrenheit to celsius formula
C
3 votes367 views2 answers
Gcc compiler for windows 10
C
7 votes381 views3 answers
How to reverse a string in c
C
0 vote412 views1 answer
Youbook
C
0 vote410 views1 answer
Cast from float to long c
C