数据结构考研分类复习真题 第十章 排序[26]

．表插入排序的基本思想是在结点中设一指针字段插入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

()(分) 表插入排序的最大比较次数是___()___;

()(分)表插入排序的最小比较次数是___()___;

()(分)记录移动的次数是___()___;

()(分)需要附加的存储空间是___()___;

()(分)该排序算法是否是稳定的___()___

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []