程序设计综合实践教学课件3-2 归并排序和快速排序.pptxVIP

三、归并排序; ;//算法3.5 归并排序。对存放n个元素的数组按关键字递增排序 void MergeSort (ElemType A[], int low, int high, ElemType Aux[]) { if (low = high) return; //规模不超过1，无需排序 m = (low + high) div 2; // 二分法划分 MergeSort (A, low, m，Aux); //前一半子序列排序 MergeSort (A, m+1, high，Aux); //后一半子序列排序 Merge (A, low, m, high, Aux); //归并两段有序子序列 for (i = low; i = high; ++i) A [i] = Aux [i]; //移动回原数组 }; //归并排序???有序段合并子算法 void Merge (ElemType A[], int low, int m, int high, ElemType Aux[]) { i = low; /