算法的排序-插入、交换、选择、归并、基数、外排序.pptVIP

template class Type void datalistType :: MergePass ( dataListType mergedList, const int len ) { int i = 0; while (i+2*len = CurrentSize-1) { merge(mergedList, i, i+len-1, i+2*len-1); i += 2 * len; //循环两两归并 } if ( i+len = CurrentSize-1 ) merge(mergedList, i, i+len-1, CurrentSize-1); else for ( int j = i; j = CurrentSize-1; j++) mergedList.Vector[j] = Vector[j]; } 迭代的归并排序算法 21 25 25* 25* 93 62 72 08 37 16 54 49 21 25 49 62 93 08 72 16 37 54 21 25 25* 49 08 62 72 93 16 37 54 08 08 21 16 25 21 25* 25 49 25* 62 37 7