pascal 冒泡排序 给我一个完整代码

例:输入序列数据按非减顺序输出。KWb妈妈金融财经网财经门户

程序1:KWb妈妈金融财经网财经门户

program mppx;KWb妈妈金融财经网财经门户

const n=7;KWb妈妈金融财经网财经门户

var a:array[1..n] of integer;KWb妈妈金融财经网财经门户

i,j,k,t:integer;KWb妈妈金融财经网财经门户

beginKWb妈妈金融财经网财经门户

write('Enter date:');KWb妈妈金融财经网财经门户

for i:= 1 to n do read(a[i]);KWb妈妈金融财经网财经门户

for i:=1 to n -1 doKWb妈妈金融财经网财经门户

for j:=n downto i+1 doKWb妈妈金融财经网财经门户

if a[j-1]begin t:=a[j-1];a[j-1]:=a[j];a[j]:=t end; write('output data:'); for i:= 1 to n do write(a[i]:6); writeln; end. 程序2： program mppx; const n=7; var a:array[1..n] of integer; i,j,k,t:integer; bool:boolean; begin write('Enter date:'); for i:= 1 to n do read(a[i]); i:=1;bool:=true; while (i begin bool:=false; for j:=n downto i+1 do if a[j-1] begin t:=a[j-1];a[j-1]:=a[j];a[j]:=t;bool:=true end; i:=i+1; end; write('output data:'); for i:= 1 to n do write(a[i]:6); writeln; end. 程序3： program mppx; const n=7; var a:array[1..n] of integer; i,j,k,t:integer; begin write('Enter date:'); for i:= 1 to n do read(a[i]); writeln; k:=n; while k>0 do begin j:=k-1;k:=0; for i:=1 to j do if a[i]>a[i+1] then begin t:=a[i];a[i]:=a[i+1];a[i+1]:=t;k:=i;end; end; write('output data:'); for i:= 1 to n do write(a[i]:6); writeln; end.KWb妈妈金融财经网财经门户