．以歸並算法為例比較內排序和外排序的不同說明外排序如何提高操作效率【華南師范大學 四(分)】
．對輸入文件();當k=時使用置換選擇算法寫出建立的初始敗者樹及生成的初始歸並段【北方交通大學 四(分)】
類似本題的另外敘述有
()給出一組關鍵字T=()設內存工作區可容納個記錄寫出用置換選擇排序得到的全部初始歸並段【上海交通大學 十】
()用置換選擇排序法產生文件 F(長度為 n)的初始歸並段(設內存緩沖區的長度為m)
① 平均情況下初始歸並段的長度為多少？為什麼？
② 初始歸並段的長度最長與最短時其長度分別為多少？在何種情況下出現？簡單解釋一下【上海交通大學 九(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/22954.html
