程序(a)()true ()a[i]:=t () TO n step ()true ()NOT flag
程序(b)() ()a[i]=t ()(i=;i<=n;i+=) () ()flag
(QACSQDFXRHMY)(FHCDQAMQRSYX)
初始归并段(顺串)
初始归并段初始归并段减少外存信息读写次数(即减少归并趟数)增加归并路数和减少初始归并段个数
én/mù
.()mj () m:=j+ ()j+n () n:=j 最大栈空间用量为O(logn)
四应用题
假设含n个记录的序列为{ R R …Rn }其相应的关键字序列为{ K K …Kn }这些关键字相互之间可以进行比较即在它们之间存在着这样一个关系Ks≤Ks≤…≤Ksn按此固有关系将n个记录序列重新排列为{ Rs Rs …Rsn }若整个排序过程都在内存中完成则称此类排序问题为内部排序
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []