1211练习参考程序(顺序,链接插入合并排序)

要求分别用数组和单链表的形式操作：一．分别输入一系列正整数(输入数据个数N>3)输入0结束。

1．生成两个有序表（递增次序），分别输出结果。

2．合并两个有序表（递增次序），输出合并后结果。

参考程序：
1．顺序表参考程序（使用插入排序INS_mer_SORT.PAS）
program a1;
const nn=10;
type arr=array[1..nn]of integer;
crr=array[1..2*nn]of integer;
var a,b:arr;
c:crr;
i,j,k,l:integer;
x,m,n:integer;
procedure insesort(var a:arr;var l:integer);{插入排序}
var i,j,k,x:integer;
begin
readln(x);
while((x<>0) and (l<nn)) do
begin
if l=0 then
a[1]:=x
else
begin
j:=1;
while (j<=l)and(x>=a[j]) do
j:=j+1;
if x<a[j] then
for k:=l downto j do
a[k+1]:=a[k];
a[j]:=x;
end;
l:=l+1;
readln(x);
end;
end;
procedure merglist(var c:crr;var l:integer;a,b:arr;m,n:integer);{合并有序表} var i,j,k:integer;
begin
i:=1;j:=1;k:=1;
while (i<=m)and(j<=n) do
if a[i]<=b[j] then
begin
c[k]:=a[i];i:=i+1;k:=k+1;
end
else
begin
c[k]:=b[j];j:=j+1;k:=k+1;
end;
if (i>m) then
while(j<=n) do
begin
c[k]:=b[j];j:=j+1;k:=k+1;
end
else
while(i<=m) do
begin
c[k]:=a[i];i:=i+1;k:=k+1;
end;
l:=k-1;
end;
procedure putlist1(a:arr;l:integer); {输出表} var i:integer;
begin
for i:=1 to l do
write(a[i],',');
writeln;
end;
procedure putlist2(a:crr;l:integer);
var i:integer;
begin
for i:=1 to l do
write(a[i],',');
writeln;
end;
begin{main}
m:=0;
insesort(a,m);
write('list a:=');
putlist1(a,m);
n:=0;
insesort(b,n);
write('list b:=');
putlist1(b,n);
l:=0;
merglist(c,l,a,b,m,n);
write('list c:=');
putlist2(c,l);
readln;
end.
2.单链表参考程序（使用插入排序linksort_dec.pas）
type pointer=^node;
node=record
data:integer;
next:pointer;
end;
var head,head1,head2:pointer;
x:integer;
procedure lsort(var head:pointer); {插入排序}
var x:integer;
p,q,t:pointer;
begin
write('input x:(x<>o)');
readln(x);
while x<>0 do
begin
new(t);
t^.data:=x;
t^.next:=NIL;
if head=NIL THEN {表空插入}
head:=t
else {表不空}
begin
p:=head;
while (p<>NIL) and (p^.data<x) do {搜索插入位置}
begin
q:=p; {搜索插入位置时，q在前,p在后}
p:=p^.next;
end;
if p=NIL then {插入表尾}
q^.next:=t
else
if p=head then {插入表首}
begin
t^.next:=head;
head:=t;
end
else {一般插入}
begin
t^.next:=p;
q^.next:=t;
end;
end;
write('input x:(x<>o)');
readln(x);
end;
end;
procedure mergelist(var head:pointer;head1,head2:pointer);{head1表,head2表合并存入head表} var p,t:pointer; {t为表尾指针}
begin
while((head1<>nil)and(head2<>nil))do {表1和表2均未到末端}
begin
if (head1^.data<head2^.data) then {从2个表中删除值小的表首结点，由p 指向} begin
p:=head1;
{writeln('head1:',p^.data);}
head1:=head1^.next;
end
else
begin
p:=head2;
{writeln('head2:',p^.data);}
head2:=head2^.next;
end;
if head=nil then {合并到head表中}
begin
head:=p;t:=p;p^.next:=nil; { head 表空，p既是首head，也是尾t}
end
else
begin {p插入表尾}
t^.next:=p;
t:=p;
p^.next:=nil;
end;
end;
if head1=nil then {如果head1先到尾，将head2表整个并入head表}
t^.next:=head2
else {否则将head1表整个并入head表}
t^.next:=head1;
end;
procedure putlist(head:pointer); var p:pointer;
begin
p:=head;
while p<>NIL do
begin
write(p^.data,',');
p:=p^.next;
end;
writeln;
end;
begin
head1:=nil;
head2:=nil;
lsort(head1);
write('list1:');
putlist(head1);
lsort(head2);
write('list2:');
putlist(head2);
head:=nil;
mergelist(head,head1,head2); putlist(head);
readln;
end.。