冒泡排序等C++程序代码

《冒泡排序等C++程序代码》由会员分享，可在线阅读，更多相关《冒泡排序等C++程序代码（7页珍藏版）》请在装配图网上搜索。

1、#include#include#include#include#defineElemTypelong*冒泡排序TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxlongBubblesort(longR,longn)intflag=1;longBC=0;for(longi=1;i=i;j-)if(RjRj-1)/当flag为0,则停

2、止排序/i表示趟数,最多n-1趟/开始时元素未交换/发生逆序longt=Rj;Rj=Rj-1;Rj-1=t;flag=1;/交换,并标记发生了交换BC+;for(longi=0;in;i+)coutRi;coutendl;returnBC;*选择排序*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*TxTxTxTxTxTxTxTx

3、TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxlongselectsort(longR,longn)longi,j,m;longt,SC=0;for(i=0;in-1;i+)m=i;for(j=i+1;jn;j+)/选择最小记录if(RjRm)m=j;if(m!=i)/与第i个记录交换t=Ri;Ri=Rm;Rm=t;SC+;returnSC;*直接插入排序Tx

4、TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxlonginsertsort(longR,longn)longIC=0;for(longi=1;i=0)&(tempRj)Rj+1=Rj;j-;/将一个记录插入到已排好的有序序列i表示插入次数，共进行n-1次插入/把待排序元素赋给temp/顺序比较和移动IC+;Rj+1=temp;for

5、(longi=0;in;i+)coutRi;coutendl;returnIC;/TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTx*快速排序*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1

6、*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTx/longquicksort(longR,longleft,longright,longn)/第一个记录作枢轴记录/从表的两端交替地向中间扫描staticlong

7、QC=0;longi=left,j=right;longtemp=Ri;while(itemp)&(ji)/比枢轴记录小的纪录移到低端j=j-1;if(ji)Ri=Rj;i=i+1;while(Rii)/比枢轴记录大的纪录移到高端i=i+1;if(ij)Rj=Ri;j=j-1;/二次划分得到基准值的正确位置QC+;Ri=temp;for(longk=0;kn;k+)coutRk;coutendl;if(lefti-1)quicksort(R,left,i-1,n);/递归调用左子区间if(i+1right)quicksort(R,i+1,right,n);/递归调用右子区间returnQC;/

8、输出数组中的元素voidprint(ElemTypeR,intn)for(inti=0;i=n-1;i+)if(i%10=0)coutendl;coutRisetw(6);coutendl;*操作选择函数TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTx/voidoperate(longa,longn)long*R=newlongn

9、;clock_tstart,end;doubleduration1,duration2,duration3,duration4;longdegree;charch;coutch;switch(ch)case1:for(inti=0;in;i+)Ri=ai;start=(double)clock();/直接插入排序开始前的时间degree=Bubblesort(R,n);end=(double)clock();/直接插入排序结束后的时间durationl=(double)(end-start)/CLK_TCK;直接插入排序所花费的时间cout冒泡排序所用时间：tdurationln;cout冒泡

10、排序交换次数：tdegreen;coutn;print(R,n);operate(a,n);break;case2:for(inti=0;in;i+)Ri=ai;start=(double)clock();/选择排序开始前的时间degree=selectsort(R,n);end=(double)clock();/选择排序结束后的时间duration2=(double)(end-start)/CLK_TCK;/选择排序所花费的时间cout选择排序所用时间：tduration2n;cout选择排序交换次数：tdegreen;coutn;print(R,n);operate(a,n);break;

11、case3:for(inti=0;in;i+)Ri=ai;start=(double)clock();/直接插入排序开始前的时间degree=insertsort(R,n);end=(double)clock();/直接插入排序结束后的时间duration3=(double)(end-start)/CLK_TCK;直接插入排序所花费的时间cout直接插入排序所用时间：duration3n;cout直接插入排序交换次数：degreen;coutn;print(R,n);operate(a,n);break;case4:for(inti=0;in;i+)Ri=ai;start=(double)cl

12、ock();/快速排序开始前的时间degree=quicksort(R,0,n-1,n);end=(double)clock();/快速排序结束后的时间duration4=(double)(end-start)/CLK_TCK;/快速排序所花费的时间cout快速排序所用时间：tvvduration4vvn;cout快速排序交换次数：tdegreen;coutn;print(R,n);operate(a,n);break;case5:break;default:cout输入错误，请选择正确的操作！n;break;/TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxT

13、xTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTx*主函数*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*TxTxTxTxTxTxTxTxTxTxTx

14、TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTx/voidmain()coutn*排序算法比较*endl;cout=endl;cout*1-冒泡排序*endl;cout*2-选择排序*endl;cout*3-直接插入排序*endl;cout*4-快速排序*endl;cout*5-退出程序*endl;cout=endl;coutn;coutendl;long*a=newlongn;coutx;switch(x)case1:cout你选择的输入方法是动手输入t”；cout请动手输入t;for(longi=0;iai;print(a,n);/输出数operate(a,n);break;case2:srand(0);for(longi=0;in;i+)ai=rand();print(a,n);/输出随机数operate(a,n);break;default:cout输入错误n;break;