数据结构考研分类复习真题 第十章 答案[27]

设归并路数为k归并趟数为s则s=élogkù因élogkù= 所以k=即最少路归并

证明由置换选择排序思想第一个归并段中第一个元素是缓沖区中最小的元素以后每选一个元素都不应小于前一个选出的元素故当产生第一个归并段时(即初始归并段)缓沖区中m个元素中除最小元素之外其他m个元素均大于第一个选出的元素即当以后读入元素均小于输出元素时初始归并段中也至少能有原有的m个元素证毕

因()%()=故第一次归并时加一个虚段

WPL=*+(++++)*+*=

类似叙述

()加()%()=个虚段

WPL=(++)*+(++++++)*+(+)*=

()()()略

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []