排序实验程序

for(i=1;i

}//简单选择排序 //堆排序

void HeapAdjust(SqList &H,int s,int m){ int j; RedType rc; rc.key=H.r[s].key ; for(j=2*s;j<=m;j*=2){ if(j=H.r[j].key) break; H.r[s].key=H.r[j].key; s=j; } H.r[s].key=rc.key; }

void HeapSort(SqList &H){ int i; KeyType t; for(i=H.length/2;i>0;--i) HeapAdjust(H,i,H.length); for(i=H.length;i>1;--i){ t=H.r[1].key; H.r[1].key=H.r[i].key; H.r[i].key=t; HeapAdjust(H,1,i-1); } }//堆排序 void main(){ SqList L; int first,final,i; RedType d[MAXSIZE+1]; int dlta[]={17,13,7,5,3,1}; inittable(L,MAXSIZE); cout<<\初始数据：\\n\ OutPut(L); //InsertSort(L); //BInsertSort(L); //InsertSort2(L,d,first,final);

}

cout<<\排序后数据：\\n\//OutPut(L);

//OutPut2(d,first,final,L.length ); //BubbleSort(L); //OutPut(L); //QuickSort(L); //OutPut(L);

//ShellSort(L,dlta,6); //OutPut(L); //SelectSort(L); //OutPut(L); HeapSort(L); OutPut(L);