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

《c语言各种排序方法及其所耗时间比较程序.docx》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、C语言各种排序方法及其所耗时间比较程序ThefinaleditionwasrevisedonDecember14th,2020.#inc1udSinclude<>#include<>#include<>#include<>constintN=1000;〃数据量,用于检测算法质量constintM=1000;//执行次数〃冒泡排序(递增)voidBubblesort(intr[],intn)(intflag=l;//flag为0停止排序for(inti=l;i=i;j)if(r[j]

2、j];r[j]=r[j-l];r[j-l]=t;flag=1;)if(flag==0)return;})〃快速排序voidquicksort(intr[],intleft,intright)(inti,j;intswap;i=left;j=right;swap=r[left];while(ir[i]))i++;if(ileft)quicksort(r,left,i-

3、l);if(i=0;i—)creatheap(r,i,n);for(i=n-1;i>=0;i)(t=

4、r[0];r[0]=r[i];r[i]=t;creatheap(r,0,i-l);}return;}〃二路归并voidmerge(intr[],intrl[],intlow,intmid,inthigh)〃进行二合一的函数(inti=low,j=mid+l,k=low;while((i<=mid)&&(j<=high))(if(r[i]<=r[j])rl[k++]=r[i++];elserl[k++]=r[j++];}while(i<=mid)rl[k++]=r[i++];while(j<=high)rl[k++]=r[j++];}一voidmergepass(intr[]

5、,intrl[],intlength)〃用来区分填入merge函数的变量计算式(inti=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-l

6、);length=2*length;mergepass(rl,r,length);length=2*length;}return;}〃进行输出voidprint(intr[],intn)(for(inti=0;i<=n-l;i++)(if(i%10==0){cout«endl;}cout<

7、ndl;cin»j;srand((unsigned)time(?(ULL));for(i=0;i