第7章-排序算法.pptVIP

Data Mining: Concepts and Techniques 第七章：排序算法 非递归的归并排序 Void MergeSort(SqList list ) { len =1; while( len list.length ) { MergePass( list, tempList,len); len *= 2; MergePass( tempList, list, len); len *=2; } } Void MergePass(SqList initList, SqList mergedList, int len) { int i = 1; while( i+2 * len -1= list.CurrentSize-1 ) { merge(initlist, mergedList, i, i+len-1, i+2*len-1 ); i+=2*len; } if ( i+len= initList. length-1) merge(initlist,mergedList,i,i+len-1,initList. length-1 ); else