计算机软件技术基础第7章 排序.pptVIP

* * * * * * * 交换 * * 交换方式 * * * * * * * * * * * * * * * 归并排序过程 * 52, 23, 80, 36, 68, 14 [ 52] [23] [80] [36] [68] [14] [ 23, 52] [36,80] [14,68] [ 23,36,56,80] [14,68] [ 14, 23, 36, 52, 68, 80 ] 一次“归并排序”的算法 * void merge(SqList L, SqList L1, int low, int mid, int high) { int i,j,k; i = low; j = mid+1; k = low; while((i=mid)(j=high)){ if(L.r[i].key=L.r[j].key) L1.r[k++]=L.r[i++]; else L1.r[k++]=L.r[j++]; } while(i=mid) L1.r[k++]=L.r[i++]; while(j=high) L1.r[k++]=L.r[j++]; } 一趟“归并排序”的算法 void mergePass(SqList L, SqList L1, int len