不同排序算法的比较.doc

《不同排序算法的比较.doc》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、不同排序算法的比较上级源程序#include"stdio.h"#include"malloc.h"#include"stdlib.h"#include"conio.h"#defineMAXSIZE101intbj=0,yd=0;typedefstruct{intkey;}rectype;intcreatlist(rectyper[]){inti,k;printf("inputnumberofdata(k)");scanf("%d",&k);for(i=1;i<=k;i++)r[i].key=rand()%100+50;return(k);}frontdisplist(rectyper[],in

2、tn){inti;printf("outputoriginaldata");for(i=1;i<=n;i++){printf("%7d",r[i].key);if(i%10==0)printf("");}getch();printf("");}reardisplist(rectyper[],intn){inti;printf("outputordereddata");for(i=1;i<=n;i++){printf("%7d",r[i].key);if(i%10==0)printf("");}printf("");}insertsort(rectyper

3、d[],intn){inti,j;rectyper[MAXSIZE];bj=0,yd=0;for(i=1;i<=n;i++)r[i]=rd[i];for(i=2;i<=n;i++){r[0]=r[i];yd=yd+1;j=i-1;while(r[0].key

4、ypetemp;bj=0,yd=0;for(i=0;i=i;j--){bj=bj+1;if(r[j+1].key

5、i]=rd[i];for(i=1;i

6、emp.key=1;i--)sift(r,i,n);for(i=n;i>=2;i--){temp=r[1];r[1]=r[i];r[i]=temp;yd=yd+3;sift(r,1,i-1);}printf("bj=%d,

7、yd=%d",bj,yd);reardisplist(r,n);}merge(rectyper[],intlow,intm,inthigh){rectyper1[MAXSIZE];inti,j,k;i=low;j=m+1;k=0;while(i<=m&&j<=high)if(r[i].key<=r[i].key){r1[k]=r[i];bj=bj+1;yd=yd+1;i++;j++;}else