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

．下面是冒泡排序算法请阅读并完成该程序并回答以下问题

PROCEDURE bubblesort (rn)

BEGIN

i:=; m:=n; flag:=;

WHILE (i<=()___)AND(flag=()____) DO

BEGIN

flag:= ()___;

FOR j:= TO m DO

IF r[j]key>r[j+]key THEN

BEGIN flag:= ()___; t:=r[j]; r[j]:=r[j+]; r[j+]:=t

END;

i:=i+;m:=m

END;

END

() 请在上面横线上填上适当的语句完成该算法程序

() 设计标志flag的作用是什么？

() 该算法结点的最大比较次数和最大移动次数是多少？

() 该分类算法稳定吗？【上海海运学院 六(分) 六(分)】

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