程序(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 }若整個排序過程都在內存中完成則稱此類排序問題為內部排序
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23204.html
