多种排序算法之综合测试程序(VC++调试通过).docVIP

#includeiostream.h #includeiomanip.h #includeconio.h #includestdlib.h #includetime.h #define MAXSIZE 20 #define LT(a,b) ((a)(b)) typedef int KeyType; typedef int InfoType; typedef struct{ KeyType key; InfoType otherinfo; }RedType; typedef struct{ RedType r[MAXSIZE+1]; int length; }SqList; //插入排序法 void InsertSort(SqList *L) { int i,j; for(i=2;i=L-length;++i) if(LT(L-r[i].key,L-r[i-1].key)) { L-r[0]=L-r[i]; for(j=i-1;LT(L-r[0].key,L-r[j].key);--j) L-r[j+1]=L-r[j]; L-r[j+1]=L-r[0]; } }// InsertSort //折半插入排序法 void BInsertSort(SqList *L) { int i,j; int low,high,m; for(i=2;i=L-length;++i) { L-r[0]=L-r[i]; low=1;high=i-1; while(low=high) { m=(low+high)/2; if (LT(L-r[0].key,L-r[m].key)) high=m-1; else low=m+1; }//while for(j=i-1;j=high+1;--j) L-r[j+1]=L-r[j]; L-r[high+1]=L-r[0];} }// BInsertSort //快速排序法 int Partition(SqList *L,int low,int high) { int pivotkey; L-r[0]=L-r[low]; pivotkey=L-r[low].key; while(lowhigh) { while(lowhighL-r[high].key=pivotkey) --high; L-r[low]=L-r[high]; while(lowhighL-r[low].key=pivotkey) ++low; L-r[high]=L-r[low]; }// while L-r[low]=L-r[0]; return low; }// Partition void QSort(SqList *L,int low,int high) { int pivotloc; if(lowhigh){ pivotloc=Partition(L,low,high); QSort(L,low,pivotloc-1); QSort(L,pivotloc+1,high);} }// QSort void QuickSort(SqList *L) { QSort(L,1,L-length); }// QuickSort,快速排序法至此结束 //选择排序法 int SelectMinKey(SqList L,int i) { int k;int j; k=i; for(j=i;jL.length+1;j++) if(L.r[k].keyL.r[j].key) k=j; return k; }// SelectMinKey void SelectSort(SqList *L) { RedType t; int i,j; for(i=1;iL-length;++i){ j=SelectMinKey(*L,i); if(i!=j) { t=L-r[i]; L-r[i]=L-r[j]; L-r[j]=t; }//if }//for }// SelectSort //堆排序法 typedef SqList HeapType; void HeapAdjust(HeapType *H,int s,int m) { RedType rc; int j; rc=H-r[s]; for(j=2*s;j=m;j*=2) { if(jmLT(H-