1003快速排序

我第一次写的快排：运行程序时发现可以，但是程序会超时

#include<stdio.h>
void qsort(int low,int high,int *a);
int main()
{
int a[10000]={0};
int n=0,i=0;
scanf("%d",&n）;
for（i=0;i<n;i++)
scanf("%d",a[i]);
qsort(0,n-1,a);
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
void qsort(int low,int high,int *a)
{
if(low<high)
{
int left=low,right=high,key=a[low];
while(left<right)
{
while(left<right&&a[right--]>key);
a[left]=a[right];
while(left<right&&a[left++]<key);
a[right]=a[left];
}
a[left]=key;
qsort(low,left-1,a);
qsort(left+1,high,a);
}
}

这是优化过的代码，边界条件更多，更难于理解一些

#include<stdio.h>
void qsort(int low,int high,int *a);
int position(int low,int high,int *a);
int main()
{
    int a[10000]={0};
    int n=0,i=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d",&a[i]);
    qsort(0,n-1,a);
    for(i=0;i<n;i++)
        printf("%d\n",a[i]);
    return 0;
}
void qsort(int low,int high,int *a)
{
    if(low<high)
 {
    int pos=position(low,high,a);
    qsort(low,pos-1,a);
    qsort(pos+1,high,a);
 }
}
int position(int low,int high,int *a)
{
    int left=low,right=high+1,x;
    while(left<right)
    {
        while(left<high&&a[++left]<a[low]);
        while(a[--right]>a[low]);
        if(left>right) break;
        x=a[left];
        a[left]=a[right];
        a[right]=x;
    }
    x=a[low];
    a[low]=a[right];
    a[right]=x;
    return right;
}