#include <stdio.h>
#include <stdlib.h>
FILE *fin,*fout;
void file_start()
{
if((fin=fopen("qsort.in","r"))==NULL)
{
printf("Cannot open this file!\n");
getchar();
exit(0);
}
if((fout=fopen("qsort.out","w"))==NULL)
{
printf("Cannot open this file!\n");
getchar();
exit(0);
}
}
void Qsort(int number[],int startPos, int endPos)
{
int i,j,temp;
temp=number[startPos];
i=startPos; j=endPos;
while(i<j)
{
while(number[j]>=temp && i<j)--j;
number[i]=number[j];
while(number[i]<=temp && i<j)++i;
number[j]=number[i];
}
number[i]=temp;
if(i-1>startPos) Qsort(number,startPos,i-1);
if(endPos>i+1) Qsort(number,i+1,endPos);
}
int main()
{
int number[100000]={0},n,i;
file_start();//方便输入输出，可以删除
fscanf(fin,"%d",&n);
for(i=0;i<n;i++)
fscanf(fin,"%d",&number[i]);
Qsort(number,0,n-1);
for(i=0;i<n;i++)
fprintf(fout,"%d ",number[i]);
system("pause");
return 0;
}

不知道写得对不对？现在对10000个数排序是小于0.2秒的

我只是说这个快排代码写得对不对

您的代码我已经看过了，但是请您评价一下，我的代码写得对吗？

无语，50W个数也能1秒

代码：
#include <stdio.h>
#include <stdlib.h>
FILE *fout;
void Qsort(int number[],int startPos, int endPos)
{
int i,j,temp;
temp=number[startPos];
i=startPos; j=endPos;
while(i<j)
{
while(number[j]>=temp && i<j)--j;
number[i]=number[j];
while(number[i]<=temp && i<j)++i;
number[j]=number[i];
}
number[i]=temp;
if(i-1>startPos) Qsort(number,startPos,i-1);
if(endPos>i+1) Qsort(number,i+1,endPos);
}
int main()
{
long number[500000]={0},n,i;
fout=fopen("qsort.out","w");
srand((unsigned long)time(0));
scanf("%d",&n);
for(i=0;i<n;i++)
number[i]=rand()%100001;
Qsort(number,0,n-1);
for(i=0;i<n;i++)
fprintf(fout,"%ld ",number[i]);
system("pause");
return 0;
}

100W你家有这么大的内存吗？-----

冒昧问一句，怎么对多个关键词排序

已经解决了，thanks