快速排序c语言

#include<stdio.h>
#include<stdlib.h>
int getstandard(int all[],int left,int right)
{
int key=all[left];
while(left<right)
{
while(left<right&&all[right]>=key)
{
right–;
}
if(right>left)
{
all[left]=all[right];
}
while(left<right&&all[left]<=key)
{
left++;
}
if(left<right)
{
all[right]=all[left];
}
}
all[left]=key;
return left;
}
void quicksort(int all[],int left,int right)
{
if(left<right)
{
int standard=getstandard(all,left,right);
quicksort(all,left,standard-1);
quicksort(all,standard+1,right);
}
}
int main()
{
int n,i;
scanf("%d",&n);
int all[n];
for(i=0;i<n;i++)
{
scanf("%d",&all[i]);
}
quicksort(all,0,n-1);
for(i=0;i<n;i++)
{
printf("%d ",all[i]);
}
return 0;
}