quicksort.c

#include <stdio.h>
void swap(int* a, int* b)
{
    int t = *a;
    *a = *b;
    *b = t;
}

int partition (int a[], int low, int high)
{
    int pivot = a[high];
    int i = (low - 1);
 
    for (int j = low; j <= high- 1; j++)
    {
        if (a[j] <= pivot)
        {
            i++;
            swap(&a[i], &a[j]);
        }
    }
    swap(&a[i + 1], &a[high]);
    return (i + 1);
}

void quickSort(int a[], int low, int high)
{
    if (low < high)
    {
        int pi = partition(a, low, high);
        quickSort(a, low, pi - 1);
        quickSort(a, pi + 1, high);
    }
}

int main()
{
    int a[] = {1,2,5,6,3,4,7,9,8,10};
    int n = sizeof(a)/sizeof(a[0]);
    quickSort(a, 0, n-1);
    printf("Sorted:");
    int i;
    for (i=0; i < n; i++)
        printf("%d ", a[i]);
    return 0;
}