．表插入排序的基本思想是在結點中設一指針字段插入Ri時Rl到Ri己經用指針按排序碼不減次序鏈結起夾這時采用順序比較的方法找到Ri應插入的位置做鏈表插入如此反復直到把Rn插入為止
()(分)請完成下列表插人的算法;【山東工業大學 五(分)】 【山東大學 五】
① R[]LINK←___()___; R[N]LINK←___()___;
② 循環I以為步長從___()___到___()___執行
()P← R[]LINK; Q←
()循環當P>且___()___時反復執行
Q←P; P←___()___
()R[Q]LINK←I; R[I]LINK←P
()(分) 表插入排序的最大比較次數是___()___;
()(分)表插入排序的最小比較次數是___()___;
()(分)記錄移動的次數是___()___;
()(分)需要附加的存儲空間是___()___;
()(分)該排序算法是否是穩定的___()___
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/22983.html
