C语言四种排序算法时间复杂比较计算机C++资料

N;i++){a[i]=rand()%30000+1;}getime);}doubleTBubbleSort(inta[a[j-1];a[j-1]=temp;}}比拟,N;i++){a[i]=rand()%30000+1;}getime);}doubleTBubbleSort(inta[a[j-1];a[j-1]=temp;}}比拟,找出本趟最小or(j=i;j>0&&a[j-1]>temp;j--)a[{}{{}}{{}}!\n",TIMES[2]);printf("printf(nter(&mliPerfStart);InsertSort\nFILE*fp;fp=fopen("用快速排序法用的时间system("cls");TIMES1[1]=TIMES[!\n",TIMES[2]);printf("printf(nter(&mliPerfStart);InsertSort\nFILE*fp;fp=fopen("用快速排序法用的时间system("cls");TIMES1[1]=TIMES[{{{}}}{{选择排序算法{}}}{i=0;i<N;i++)5/10.fprintf(fp,"%Now);doubletime=liPerfNow.Quadta[],intp)//计算直接插入排序算法用时{inti;i=0;i<N;i++)5/10.fprintf(fp,"%Now);doubletime=liPerfNow.Quadta[],intp)//计算直接插入排序算法用时{inti;t[N];top++;st[top].low=0;st[to{{{{{}{}}}}}/10.if(TIMES[1]!=TIMES[2]){if(};QueryPerformanceCounter(&liPueryPerformanceCounter(&liPerf(time);}doubleTSelectSort(inta./10.if(TIMES[1]!=TIMES[2]){if(};QueryPerformanceCounter(&liPueryPerformanceCounter(&liPerf(time);}doubleTSelectSort(inta计算直接插入排序算法用时{LARGE_INTEGERm_liPerfFreq={0};LARGE_INTEGERLARGE_INTEGERliPerfNow={0};{}{LARGE_INTEGERm_liPerfFreq={0};LARGE_INTEGER{har();break;case2:TInsertSort(排序平均时间复杂度是0(nlog2n)，最好情况0(nloghar();break;case2:TInsertSort(排序平均时间复杂度是0(nlog2n)，最好情况0(nlogueryPerformanceCounter(&liPerfe);}doubleTquicksort(inta[],in}LARGE_INTEGERliPerfNow={0};}{LARGE_INTEGERm_liPerfFreq={0};LARGE_INTEGERLARGE_INTEGERliPerfNow={0};{}temp)i++;if(i<j){a[j]=a[i];j--按任意键继续!");运行结果与分析：通过屡次运行程序，均显示1:Disp(a);FILE*fp;7/10.fp=fopetemp)i++;if(i<j){a[j]=a[i];j--按任意键继续!");运行结果与分析：通过屡次运行程序，均显示1:Disp(a);FILE*fp;7/10.fp=fopee/=mliPerfFreq.QuadPart;if(p!=}{LARGE_INTEGERm_liPerfFreq={0};LARGE_INTEGERLARGE_INTEGERliPerfNow={0};{}{{{],intp)//计算冒泡排序算法用时{inti;intb[e/=mliPerfFreq.QuadPart;if(p!=yPerformanceFrequency(&mliPerf],intp)//计算冒泡排序算法用时{inti;intb[e/=mliPerfFreq.QuadPart;if(p!=yPerformanceFrequency(&mliPerf;a[k]=a[i];a[i]=temp;}}}voidBu}}}{}{{{}{{inti,p,a[N];srand((int)time(N*******************\n\n");prinhar();break;case2:TInsertSort(f(a[j+1]<a[j]){temp=a[j+1];6/1.{inti,p,a[N];srand((int)time(N*******************\n\n");prinhar();break;case2:TInsertSort(f(a[j+1]<a[j]){temp=a[j+1];6/1{);TIMES1[4]=TIMES[4]=TquicksorPart-mliPerfStart.QuadPart;timp;for(i=1;i<N;i++){temp=a[i];fw);doubletime=liPerfNow.QuadPa.);TIMES1[4]=TIMES[4]=TquicksorPart-mliPerfStart.QuadPart;timp;for(i=1;i<N;i++){temp=a[i];fw);doubletime=liPerfNow.QuadPa{直接选择排序%f}}{}}}}(b,p);LARGEINTEGERliPerfNow={0++)fprintf(fp,"%d