#include <stdio.h>
void swap(int *pa, int *pb)
{
int temp;
temp = *pb;
*pb = *pa;
*pa = temp;
}
void quick_sort(int *data, int left, int right)
{
int i, j, key, temp;
if(left < right)
{
i = left+1;
j = right;
key = data[left];
while (i-1 < j)
{
while(data[i] <= key)
{
i++;
}
while(data[j] > key)
{
j--;
}
if(i < j)
{
swap(&data[i],&data[j]);
}
}
swap(&data[left],&data[j]);
quick_sort(data,left,j-1);
quick_sort(data,j+1,right);
}
}
int main()
{
int a[9] = {0,7,18,5,86,9,10,50,4};
/*for(int i = 1; i <= 8; i++)
{
scanf("%d",&a[i]);
}
*/
/*
printf("==============before sort========\n");
for(int i = 1; i <= 8; i++)
{
printf("%d ", a[i]);
}
printf("\n");
quick_sort(a,1,8);
printf("===============after sort========\n");
for(int i = 1; i <= 8; i++)
{
printf("%d ", a[i]);
}
}