选择排序主件:Begin for I := 1 To N - 1 Do //做N - 1趟选择排序 begin K := I; For J := I + 1 To N Do //在当前无序区R[I..N]中选最小的元素R[K] Begin If R[J] < R[K] Then K := J end; If K I Then //交换R[I]和R[K] begin Temp := R[I]; R[I] := R[K]; R[K] := Temp; end; end; End; 冒泡排序主件: begin for i:=1 to n-1 do for j:=1 to n-i do if a[j]