#include <stdio.h>
#include <stdlib.h>
void QuickSort(int a[],int l,int r)
{
if(l>=r){
return ;
}
int left = l;
int right = r;
int p = a[left];
while(left<right){
while(left < right && a[right] >= p){
right--;
}
if(left<right){
a[left]=a[right];
}
while(left<right && a[left] <= p){
left++;
}
if(left<right){
a[right] = a[left];
}
if(left>=right){
a[left]=p;
}
}
QuickSort(a,left,right-1);
QuickSort(a,right+1,right);
}
int main()
{
int n,i;
int a[66];
printf("请输入数组长度\n");
scanf("%d",&n);
printf("请输入数组元素\n");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
QuickSort(a,0,n-1);
printf("排完序之后\n");
for(i=0;i<n;i++){
printf("%5d",a[i]);
}
return 0;
}