Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
test07
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 : 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:=3; for i:=1 to M do mas[i]:=i ; sostavlenie2(pervy, M) ; a:=pervy ; b:=true; while (a<> nil) and b do if a^.inf=3 then b:=false {key inf achieved} else begin a:=a^.sled; if a=nil then goto 1 end; writeln(a^.inf:2:1) ; goto 2 ; 1: writeln('no such key info element'); 2:end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
бассейн
la moyenne de théo
Игра НИМ
zadacha3
buscar_numero_V2_divisible_5
Mengubah biner ke desimal
8
Ejercicio SQRT
first
08 for
Please log in to post a comment.