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 vote140 views1 answer
Round function in C
C
1 vote176 views2 answers
ModuleNotFoundError: No module named 'easydict'
C
2 votes149 views1 answer
Mirzapur 2 release date and time
C
0 vote148 views1 answer
How to change the mapping from jkil to wasd in vim
C
7 votes151 views3 answers
Int to double c
C
0 vote146 views1 answer
Defining a macro in a header file
C
0 vote194 views2 answers
Get last char string c
C
0 vote144 views1 answer
Fread condition
C
0 vote216 views1 answer
Print variable adress c
C
0 vote153 views1 answer
Lsusb command not found
C