test01, Pascal - rextester

Language: Layout:

program test07;
{pointer example of direct chain growth and key inf choice}
type spisok=^elem;
    elem=record
            inf:real ;
            sled:spisok
            end ;
label 1,2;
var a, pervy,d : spisok ;
    mas: array[1..3] of integer ;
    M, i:integer ;
    b:boolean;
procedure sostavlenie2(var p1:spisok; N:integer) ;
var q,p2:spisok ;
    
begin
    New(q) ; {data generator}
    p1:=q;{head safe}
    p2:=q;
for i :=1 to N do
  begin
    q^.inf:=mas[i] ;
    q^.sled:=Nil;
    p2^.sled:=q;
    p2:=p2^.sled;
    New(q);
  end ;
end ;
 begin
     M:=5;
     for i:=1 to M do
     mas[i]:=i ;
    sostavlenie2(pervy, M) ;
    a:=pervy ;
    b:=true;
    New(d);{make new element}
    d^.inf:=10;
    d^.sled:=Nil;
while (a<> nil) and b do
     if a^.inf=2 then 
     begin
        b:=false; {key inf achieved}
        {a:=a^.sled;} {exclude current element}
        d^.sled:=a^.sled;{insert new element "d" after appoined element}
        a^.sled:=d;
     end
      else  begin a:=a^.sled;
                  if a=Nil then goto 1       
            end;
      begin
            writeln(a^.inf:2:1) ;
            writeln;
            a:=pervy;
            repeat 
                  writeln(a^.inf:2:1) ;
                  a:=a^.sled;
            until a=Nil;
                  goto 2 ;
       end;
1: writeln('no such key info element');
2:end.

Show compiler warnings [ + ] Show input
Compilation time: 0.13 sec, absolute running time: 0.17 sec, cpu time: 0.01 sec, memory peak: 5 Mb, absolute service time: 0,66 sec