//快速排序(C语言)
//17,18,60,40,7,32,73,65,85 =》 7,17,18,32,40,60,65,73,85
#include<stdio.h>
int Partivation(int a[],int low,int high){
int key=a[low];
while(low<high){
while(low<high&&a[high]>key) high--;
if(low<high){
a[low]=a[high];
low++;
}
while(low<high&&a[low]<key) low++;
if(low<high){
a[high]=a[low];
high--;
}
}
a[low]=key;
return low;
}
void quickSort(int a[],int low,int high){
if(low<high){
int pivotloc=Partivation(a,low,high);
quickSort(a,low,pivotloc-1);
quickSort(a,pivotloc+1,high);
}
}
int main(){
int a[9]={7,17,18,32,40,60,65,73,85};
int low=0;
int high=8;
quickSort(a,low,high);
int i;
for(i=0;i<9;i++)
printf("%d\t",a[i]);
return 0;
}