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

1、c语言各种排序方法及其所耗时间比较程序the final edition was revised on december 14th, 2020.# i n c 1 u dsinclude #include #include #include const int n=1000;数据量,用于检测算法质量const int m=1000;/执行次数冒泡排序(递增)void bubblesort(int r,int n) (int flag=l;/flag 为 0 停止排序for(int i=l;i=i;j) if (rjrj-l) (int t=rj;rj=rj-l;rj-l=t;flag=1;)i

2、f(flag=0)return;)快速排序void quicksort(int r,int left,int right)(int i, j;int swap;i=left;j=right;swap=rleft;while(ij) (while(ij)&(swaprjl)j-; if(ij)(ri=rj;i+；while(iri)i+; if(ileft)quicksort(r, left, i-l);if(iright)quicksort(r, i+1, right);return;)堆排序先建立堆void creatheap(int r,int i,int n)(int j;int t;t

3、=ri;j=2*i;while(jn)(if(jn)&(rjrj+l)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-l); return;二路归并void merge(int r, int rl , int low, int mid, int high)进行二合一的函数 (int i=low, j=mid+l, k=low;while(i=mid)&(j=high)(if(ri=rj)rlk+=ri+;elserlk+=rj+;while(i=mid)rlk+=ri

4、+;while(j=high)rlk+=rj+; 一void mergepass (int r , int rl , int length)用来区分填入 merge 函数的变量 计算式(int i=0, j;while (i+2*length=n) (merge (r,rl, i, i+length-l, i+2*length-l);i=i+2*length;if(i+length-ln-l)merge (r, rl, i, i+length-1, nt);elsefor(j=i;jn; j+)rlj=rj;void mergesort(int r)二路并归总算法(int length=l;i

5、nt rln+l;while(lengthn)(mergepass(r, rl, length);length=2*length;mergepass(rl, r, length);length=2*length; return;进行输出void print(int r,int n) (for (int i=0;i=n-l;i+) (if (i%10=0) coutendl; coutrisetw(6);) coutendl;主函数void main() (int i, j, k;int rx, an;clock_t start, finish;double duration;cout请选择排序

6、方式,1、冒泡法；2、快速排序法；3、堆排序法；4、二路 并归法endl;cinj;srand(unsigned) time(?(ull);for(i=0;in;i+) (ai=rand () %10000; switch(j) ( cased): (cout冒泡法； start = clock();for(i=0;im;i+) k=n-l;while(k+1) (rk=ak;k-;)bubblesort (r, );冒泡法 finish = clock();duration = (double)(finish - start)/1000;print(r, x);printf( /z%f se

7、condsll, duration );break;case(2):(cout快速排序法；start = clock();for(i=0;im;i+)(k=n-l;while(k+1)(rk=ak;k-;)quicksort (r, 0, nt);快速排序法)finish = clocko ;duration = (double)(finish - start)/1000;print (r, x);printf ( /z%f secondsll, duration );break;case(3):(cout堆排序法；start = clock();for(i=0;im;i+)(k=n-l;while(k+1)(rk=ak;k-；heapsort (r, x); 堆排序法finish = clock();duration = (double)(finish - start)/1000;print (r, x);printf ( zz%f secondsll, duration );break;case(4):cout 二路并归法;start = clock();for(i=0;im;i+)k=n-l;while(k+1) (rk=ak;k-;)mergesort