外排序中為何采用k路(k>)合並而不用路合並？這種技術用於內排序有意義嗎？為什麼？【東南大學 三 (分)】
．給定輸入文件並設記錄緩沖區個數k=寫出基於敗者樹的外排序順串生成算法runs輸出的順串【東南大學 一 (分)】
五算法設計題
．冒泡排序算法是把大的元素向上移(氣泡的上浮)也可以把小的元素向下移(氣泡的下沉)請給出上浮和下沉過程交替的冒泡排序算法【吉林大學 二 (分)】
類似本題的另外敘述有
() 編寫一個雙向氣泡排序的算法即相鄰兩遍向相反方向起泡【北京郵電大學六(分)】
．有n個記錄存儲在帶頭結點的雙向鏈表中現用雙向起泡排序法對其按上升序進行排序請寫出這種排序的算法(注雙向起泡排序即相鄰兩趟排序向相反方向起泡)【北京郵電大學 七(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/22956.html
