管家婆普普版界面:直接插入排序
来源:百度文库 编辑:中科新闻网 时间:2024/04/29 15:43:42
const n=8;
type art=array[1..n] of integer;
var
a:art;
x,i,num:integer;
procedure insert(x:integer ; var a:art ; var num:integer);
var
i,pos:integer;
search:boolean;
begin
pos:=1;
search:=true;
while search and (pos<=num) do
if x<a[pos]
then ()
else ();
for i:=() do a[i+1]:=a[i];
() ;
end;
begin
num:=0;
for i:=1 to n do
begin
read(x);
() ;
end;
for i:=1 to n do write(a[i]:4);
end.
type art=array[1..n] of integer;
var
a:art;
x,i,num:integer;
procedure insert(x:integer ; var a:art ; var num:integer);
var
i,pos:integer;
search:boolean;
begin
pos:=1;
search:=true;
while search and (pos<=num) do
if x<a[pos]
then ()
else ();
for i:=() do a[i+1]:=a[i];
() ;
end;
begin
num:=0;
for i:=1 to n do
begin
read(x);
() ;
end;
for i:=1 to n do write(a[i]:4);
end.
ni xiang shuo shm