#include <stdio.h>
void quicksork(int arr[],int L,int R)
{
int i = L;
int j = R;
int pivot = arr[(L + R) / 2];
while (i <= j)
{
while (arr[i] < pivot)
{
i++;
}
while (arr[j] > pivot)
{
j--;
}
if (i <= j)
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i++;
j--;
}
}
if (L < j)
{
quicksork(arr,L,j);
}
if (i < R)
{
quicksork(arr,i,R);
}
}
int main()
{
int arr[] = {6,7,8,4,2,1,5,9,3};
int i;
quicksort(arr, 0, 8);
for (i=0; i<9; i++)
{
printf("%d\n",arr[i]);
}
return 0;
}