c语言快速排序

#include<stdio.h>
#include<stdlib.h>
#include<time.h>

#define MAX_NUM 2000
int num[MAX_NUM];

void datagenetare(){
	FILE* fpout;
	fpout=fopen("file.txt","w");
	for(int x=0;x<MAX_NUM;x++){
		fprintf(fpout, "%d\n",rand()%10000);
	}
	fclose(fpout);
}



//快速排序一次划分
int Partition(int r[],int first,int end){
    int i = first,j = end;
    while(i < j){
        while(i < j&&r[i]<=r[j]) j--;
        if(i < j){
            int t = r[i];
            r[i] = r[j];
            r[j] = t;
            i++;
        }
        while(i < j&&r[i]<=r[j]) i++;
        if(i < j){
            int t = r[i];
            r[i] = r[j];
            r[j] = t;
            j--;
        }
    }
    return i;
}
 
void QuickSort(int r[],int first,int end){
	
    if(first < end){
        int p = Partition(r,first,end);
        QuickSort(r,first,p);
        QuickSort(r,p+1,end);
    }
}

void read(){
	FILE *fpin;
	fpin=fopen("file.txt", "r");  //只读
	
	for (int i = 0; i <MAX_NUM; ++i){
		fscanf(fpin,"%d",&num[i]); //此函数把文件中读取出来的数据赋给接收变量
	}
	fclose(fpin);
}
void show(){
	for (int i=0 ;i<MAX_NUM;i++){
		printf("%6d",num[i]);
	}
	printf("\n\n\n\n\n\n\n\n\n\n\n\n\n");
}
void main(){

	datagenetare();
	read();
	show();

	double time;
	clock_t start,end;
	start=clock();

	QuickSort(num,0,MAX_NUM);

	end=clock();
	time=(double)(end-start);

	show();
	printf("\n\n\n\n\n\n\n\n\n\n\n\n\n");
	printf("The CPU time is %2.6f seconds:",time);
	printf("\n\n\n\n\n\n\n\n\n\n\n\n\n");

	system("pause");

}