数据结构课程设计（排序综合）第四次实验

FILE *fp;

fp=fopen(\直接选择排序.txt\

for(i=0;i

fprintf(fp,\fclose(fp);return(time); }

double TBubbleSort(int a[],int p) {

int i; int b[N];

for(i=0;i

LARGE_INTEGER m_liPerfFreq={0};

QueryPerformanceFrequency(&m_liPerfFreq); LARGE_INTEGER m_liPerfStart={0};

QueryPerformanceCounter(&m_liPerfStart); BubbleSort(b,p);

LARGE_INTEGER liPerfNow={0};

QueryPerformanceCounter(&liPerfNow);

double time=liPerfNow.QuadPart - m_liPerfStart.QuadPart; time/=m_liPerfFreq.QuadPart; if(p!=6)

{Disp(b);getchar();}

printf(\用冒泡排序法用的时间为%f秒；\

FILE *fp;

fp=fopen(\冒泡排序.txt\

for(i=0;i

fprintf(fp,\fclose(fp);return(time); }

double Theapsort(int a[],int n,int p) {

int i; int b[N];

for(i=0;i

LARGE_INTEGER m_liPerfFreq={0};

QueryPerformanceFrequency(&m_liPerfFreq); LARGE_INTEGER m_liPerfStart={0};

QueryPerformanceCounter(&m_liPerfStart); heapsort(b,N,p);

LARGE_INTEGER liPerfNow={0};

QueryPerformanceCounter(&liPerfNow);

double time=liPerfNow.QuadPart - m_liPerfStart.QuadPart; time/=m_liPerfFreq.QuadPart; if(p!=6)

{Disp(b);getchar();}

printf(\用堆排序法用的时间为%f秒；\

FILE *fp;

fp=fopen(\堆排序.txt\

for(i=0;i

fprintf(fp,\fclose(fp);return(time); }

double Tquicksort(int a[],int n,int p) {

int i; int b[N];

for(i=0;i

LARGE_INTEGER m_liPerfFreq={0};

QueryPerformanceFrequency(&m_liPerfFreq); LARGE_INTEGER m_liPerfStart={0};

QueryPerformanceCounter(&m_liPerfStart); quicksort(b,N,p);

LARGE_INTEGER liPerfNow={0};

QueryPerformanceCounter(&liPerfNow);

double time=liPerfNow.QuadPart - m_liPerfStart.QuadPart; time/=m_liPerfFreq.QuadPart; if(p!=6)

{Disp(b);getchar(); }

printf(\用快速排序法用的时间为%f秒；\

FILE *fp;fp=fopen(\快速排序.txt\ for(i=0;i

fprintf(fp,\

fclose(fp); return(time); }

void BubleSort(double a[]) //时间数组的冒泡排序 {

int i,j; double temp; for(i=1;i<6;i++) {

for(j=4;j>=i;j--) if(a[j+1]

temp=a[j+1]; a[j+1]=a[j]; a[j]=temp; } } }

void menu() {

printf(\ ★☆************** 欢迎来到综合排序系统! ****************★☆\\n\ printf(\ ☆★ ☆★\\n\ printf(\ ★☆ ★☆\\n\printf(\ ☆★ ☆★\\n\ printf(\ ★☆ ★☆\\n\printf(\ ☆★ ☆★\\n\printf(\ ☆★ ※※※※※※※ ☆★\\n\printf(\ ★☆ ※ 菜 单 ※ ★☆\\n\printf(\ ☆★ ※※※※※※※ ☆★\\n\printf(\ ☆★ ☆★\\n\printf(\ ★☆************** (1)---直接插入排序 ******************★☆\\n\printf(\ ☆★************** (2)---直接选择排序 ******************☆★\\n\printf(\ ★☆************** (3)---冒泡排序 ******************★☆\\n\printf(\ ☆★************** (4)---快速排序 ******************☆★\\n\printf(\ ★☆************** (5)---堆排序 ******************★☆\\n\printf(\ ☆★************** (6)---时间效率比较 ******************☆★\\n\printf(\ ★☆************** (7)---显示随机数 ******************★☆\\n\printf(\ ☆★************** (0)---退出 ******************☆★\\n\printf(\ ★☆ ★☆\\n\printf(\ ☆★****************************************************☆★\\n\ printf(\请在上述序号中选择一个并输入:\}

void main() {

int i,p,a[N];

srand((int)time(NULL)); /*随机种子*/

for(i=0;i

a[i]=rand()P000+1; while(1) {

system(\ menu();

scanf(\ if(p==0) {

printf(\谢谢使用!\\n\ getchar(); break; }

double TIMES[5],TIMES1[5];//时间数组

switch(p) {

case 1:TInsertSort(a,p);printf(\请按任意键继续...\ case 2:TSelectSort(a,p);printf(\请按任意键继续...\ case 3:TBubbleSort(a,p);printf(\请按任意键继续...\ case 4:Tquicksort(a,N,p);printf(\请按任意键继续...\ case 5:Theapsort(a,N,p);printf(\请按任意键继续...\ case 6:system(\

TIMES1[1]=TIMES[1]=TInsertSort(a,p);TIMES1[2]=TIMES[2]=TSelectSort(a,p);

TIMES1[3]=TIMES[3]=TBubbleSort(a,p);TIMES1[4]=TIMES[4]=Tquicksort(a,N,p);TIMES1[5]=TIMES[5]=Theapsort(a,N,p);getchar(); BubleSort(TIMES); printf(\ {

printf(\排序这组数据两种较快的排序法分别是：\\n\

if(TIMES[1]==TIMES1[1]) printf(\直接插入排序:%f秒!\\n\ if(TIMES[1]==TIMES1[2]) printf(\直接选择排序:%f秒!\\n\ if(TIMES[1]==TIMES1[3]) printf(\冒泡排序:%f秒!\\n\ if(TIMES[1]==TIMES1[4]) printf(\快速排序:%f秒!\\n\

if(TIMES[1]==TIMES1[5]) printf(\堆排序:%f秒!\\n\ if(TIMES[1]!=TIMES[2]) {

if(TIMES[2]==TIMES1[1]) printf(\直接插入排序:%f秒!\\n\ if(TIMES[2]==TIMES1[2]) printf(\直接选择排序%f秒!\\n\ if(TIMES[2]==TIMES1[3]) printf(\冒泡排序%f秒!\\n\ if(TIMES[2]==TIMES1[4]) printf(\快速排序%f秒!\\n\ if(TIMES[2]==TIMES1[5]) printf(\堆排序%f秒!\\n\ }

} printf(\请按任意键继续...\ for(i=0;i

for(i=0;i

default:Wrong();printf(\请按任意键继续...\ } } }