内部排序算法的实现与比较(2)

int i=s; int j=m+1; int k=s; while(i<=m&&j<=t) { if(r[i]<=r[j]){r1[k++]=r[i++];bj6++;yd6++;} else {r1[k++]=r[j++];bj6++;yd6++;} } if(i<=m)while(i<=m) {r1[k++]=r[i++];yd6++;} else while(j<=t) {r1[k++]=r[j++];yd6++;} }

void main() { SqList L,M; int a; M.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType)); if(!M.elem)exit(0); a: cout<<\内部排序算法比较-----------------------------\\n\ cout<<\欢迎使***********************************\\n\ cout<<\运行程**********************************\\n\ cout<<\退出系**********************************\\n\ cout<

用序统

QuickSort(M); memory(M,L); ShellSort(M); memory(M,L); MergePass(M); cout<<\ *********比较次数**********移动次数*********\\n\ cout<<\冒泡排序： \ \ cout<<\直接插入： \ \ cout<<\简单选择: \ \ cout<<\快速排序: \ \ cout<<\希尔排序: \ \ cout<<\归并排序: \ \ cout<

bj1=0,yd1=0,bj2=0,yd2=0,bj3=0,yd3=0,bj4=0,yd4=0,bj5=0,yd5=0,bj6=0,yd6=0; goto a; }