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 vote173 views1 answer
Bootsrap textbox
C
-3 votes187 views1 answer
Uri/beecrowd problem no - 1133 solution in C
C
1 vote172 views1 answer
Linux play youtube audio only
C
0 vote173 views1 answer
Calculate the area of a circle and modify the same program to calculate the volume of a cylinder given its radius and height.
C
1 vote200 views1 answer
Java.lang.SecurityException: Permission denied (missing INTERNET permission?)
C
0 vote172 views1 answer
Solana-test-validator log
C
1 vote178 views2 answers
Memcpy
C
0 vote196 views1 answer
*** AttributeError: module 'cv2.cv2' has no attribute 'drawKeypoints'
C
0 vote171 views1 answer
Ecole de chien d'aveugles paris
C
0 vote157 views1 answer
C radians
C