升序: var i,j,k:Integer; begin for i:=1 to n-1 do for j:=i to n-1 do if a[j]>a[j+1] then begin k:=a[j]; a[j]:=a[j+1]; a[j+1]:=k; end; end;
升序: var i,j,k,m:Integer; begin m := n; for i:=1 to n-1 do begin dec(m); if m=1 then break; for j:=1 to m-1 do if a[j]>a[j+1] then begin k:=a[j]; a[j]:=a[j+1]; a[j+1]:=k; end; end; end;
var
i,j,k:Integer;
begin
for i:=1 to n-1 do
for j:=i to n-1 do
if a[j]>a[j+1] then
begin
k:=a[j];
a[j]:=a[j+1];
a[j+1]:=k;
end;
end;
var
i,j,k,m:Integer;
begin
m := n;
for i:=1 to n-1 do
begin
dec(m);
if m=1 then break;
for j:=1 to m-1 do
if a[j]>a[j+1] then
begin
k:=a[j];
a[j]:=a[j+1];
a[j+1]:=k;
end;
end;
end;