c语言各种排序方法及其所耗时间比较程序

1、e#include#include#include#includeconstintN=1000;/数据量，用于检测算法质量constintM=1000;/执行次数/冒泡排序(递增)voidBubblesort(intr,intn)intflag=1;/flag为0停止排序for(inti=1;i=i;j-)if(rjrj-1)intt=rj;rj=rj-1;rj-1=t;flag=1;if(flag=0)return;/快速排序voidquicksort(intr,intleft,intright)inti,j;intswap;i=left;j=right;swap=rleft;while(i

2、j)while(ij)&(swaprj)j-;if(ij)ri=rj;i+;while(iri)i+;if(ileft)quicksort(r,left,i-1);if(iright)quicksort(r,i+1,right);return;/堆排序先建立堆voidcreatheap(intr,inti,intn)intj;intt;t=ri;j=2*i;while(jn)if(jn)&(rjrj+1)j+;if(t=0;i-)creatheap(r,i,n);for(i=n-1;i=0;i-)t=r0;r0=ri;ri=t;creatheap(r,0,i-1);return;/二路归并vo

3、idmerge(intr,intr1,intlow,intmid,inthigh)/进行二合一的函数inti=low,j=mid+1,k=low;while(i=mid)&(j=high)if(ri=rj)r1k+=ri+;elser1k+=rj+;while(i=mid)r1k+=ri+;while(j=high)r1k+=rj+;voidmergepass(intr,intr1,intlength)/用来区分填入merge函数的变量计算式inti=0,j;while(i+2*length=N)merge(r,r1,i,i+length-1,i+2*length-1);i=i+2*lengt

4、h;if(i+length-1N-1)merge(r,r1,i,i+length-1,N-1);elsefor(j=i;jN;j+)r1j=rj;voidmergesort(intr)/二路并归总算法intlength=1;intr1N+1;while(lengthN)mergepass(r,r1,length);length=2*length;mergepass(r1,r,length);length=2*length;return;/进行输出voidprint(intr,intn)for(inti=0;i=n-1;i+)if(i%10=0)coutendl;coutrisetw(6);co

5、utendl;/主函数voidmain()inti,j,k;intrN,aN;clock_tstart,finish;doubleduration;cout请选择排序方式，1、冒泡法；2、快速排序法；3、堆排序法；4、二路并归法j;srand(unsigned)time(NULL);for(i=0;iN;i+)ai=rand()%10000;switch(j)case(1):cout冒泡法;start=clock();for(i=0;iM;i+)k=N-1;while(k+1)rk=ak;k-;Bubblesort(r,N);/冒泡法finish=clock();duration=(doubl

6、e)(finish-start)/1000;print(r,N);printf(%fsecondsn,duration);break;case(2):cout快速排序法;start=clock();for(i=0;iM;i+)k=N-1;while(k+1)rk=ak;k-;quicksort(r,0,N-1);/快速排序法finish=clock();duration=(double)(finish-start)/1000;print(r,N);printf(%fsecondsn,duration);break;case(3):cout堆排序法;start=clock();for(i=0;iM;i+)k=N-1;while(k+1)rk=ak;k-;heapsort(r,N);/堆排序法finish=clock();duration=(double)(finish-start)/1000;print(r,N);printf(%fsecondsn,duration);break;case(4):cout二路并归法;start=clock();for(i=0;iM;i+)k=N-1;while(k+1)rk=ak;k-;mergesort(