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

请阅读下列算法回答问题

PROCEDURE sort(rn)

BEGIN

FOR i:= TO n DO

BEGIN

x:=r(i);r(O):=x;j:=i;

WHILE xkey<r(j)key DO

BEGIN

r(j+):=r(j); j:=j

END;

r(j+):=x

END

END;

问题一这是什么类型的排序算法该排序算法稳定吗？

问题二设置r(O)的作用是什么？若将WHILE—DO 语句中判断条件改为xkey<=r(j)KEY该算法将会有什么变化是否还能正确工作？【上海海运学院 六 (分)】

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