Linked lists in pascal creation, modification, add, delete, display. . .✅

* This program handles all of the following things:

1- the creation of a chained list

2- The display of the elements of the list

3- Counter the number of items in the list

4- Add an element in the head of the list

5- Add an element in the queue of the list

6- Add an element to a K possition

7- Sort the list in a growing order

8- Adds an element to an already sorted list

9- Delete an element

program tp;
type liste = record 
     inf : integer ;
     suiv : ^liste ; 
 end ;    
var r : char ;
    choix : integer ; 
    courant,tete : ^liste ;
procedure affichage ;
var q : ^liste ;
begin 
if tete = nil then
writeln('the list is empty !') else 
q:=tete ;    
while (q <>nil ) do
begin
writeln('          ',q^.inf );
q := q^.suiv ;
end;
end;
procedure count;
var c : integer ;
    q : ^liste ;
begin
if tete = nil then
writeln('the list is empty !') else
q:=tete ;
c:=0 ;
while (q <>nil ) do
begin
q := q^.suiv ;
c:=c+1 ;
end;
writeln('we have ',c,' element in the list ');
end;
procedure ajoute_tete ;
var a : ^liste ;
begin
if tete = nil then
writeln('the list is empty !') else
new (a);
writeln('put a value :');
readln(a^.inf );
a^.suiv := tete ;
tete := a ;
end;                      
procedure creation;
begin
new(tete);
courant:=tete ;
writeln('put a value :');
readln(courant^.inf);
writeln('do you want to add an other value ? y/n');
readln(r);
if (r='n') then
tete^.suiv := nil 
else
begin
repeat
new (courant^.suiv); 
writeln('put a value :');
readln(courant^.suiv^.inf);
writeln('do you want to add an other value ? y/n');
readln(r);
if r = 'y' then
courant := courant^.suiv  
else 
courant^.suiv^.suiv := nil ;
until(r='n')
end; 
end;
procedure ajouter_queue ;
var r: ^liste ;
begin
if tete = nil then
writeln('the list is empty !') else
r:=tete ;
while (r^.suiv<>nil) do
begin
r:=r^.suiv ;
end;
new(r^.suiv);
r:=r^.suiv ;
writeln('put a value :');
readln(r^.inf) ;
end;
procedure ajouter ;
var q,a,b,e :^liste ;
      p,c,cc: integer ;
begin
if tete = nil then
writeln('the list is empty !') else
begin
q:=tete ;
a:=q ;
e:=tete ;
c:=0 ;
new (b);
while (q <>nil ) do
begin
q := q^.suiv ;
c:=c+1 ;
end;
while (e^.suiv <> nil ) do
begin
e:=e^.suiv ;
end;
q:=tete ;
writeln('put the adding possition :');
readln(p) ;
if p=1 then
begin 
ajoute_tete 
end 
else
if c=p then
begin
ajouter_queue 
end
else
begin
cc:=2 ;
q:=q^.suiv ;
while (q^.suiv <>nil ) do
if cc=p then 
begin
writeln('put a value :');
readln(b^.inf);
b^.suiv:=q ;
a^.suiv := b ;
c:=c+1 ; 
q:=e ; 
end 
else 
begin
cc:=cc+1 ;
q := q^.suiv ;
a:=a^.suiv ;
end;
end;
end;
end;
procedure trie ;
var a,q:^liste ;
      w:integer ;
Begin
q:=tete ;
a:=q ;
a:=a^.suiv ;
while (q<>nil)do
begin
a:=q^.suiv ;
while(a<>nil) do
if (q^.inf > a^.inf) then
begin
w:=q^.inf ;
q^.inf := a^.inf ;
a^.inf := w 
end
else
begin
a:=a^.suiv ;
end ;
q:=q^.suiv ;
end;
end;
procedure ajoute_trie ;
var r,f,g,e : ^liste ;
begin
g:=tete ;
r:=g ;
e:=r ;
while (e^.suiv<>nil) do
begin
e:=e^.suiv ;
end;
new (f);
writeln('put a value :');
readln(f^.inf);
if (f^.inf < tete^.inf ) then
ajoute_tete
else 
if (f^.inf > e^.inf ) then 
ajouter_queue
else 
begin
g:=g^.suiv ;
while (g <> nil) do 
if (g^.inf > f^.inf) then
begin
f^.suiv:=g ;
r^.suiv := f ; 
g:=nil ; 
end 
else 
begin
g := g^.suiv ;
r:=r^.suiv ;
end;
end;
end;
procedure supp ;
var b,d,f,e,q,a : ^liste ;
s,c,i : integer ;
begin
q:=tete ;
a:=q ;
d:=q ;
e:=tete ;
f:=e;
c:=0 ;
writeln('put the value do you want to delete :');
read(s) ;
while (f<>nil) do 
begin
if (f^.inf=s) then
c:=c+1 
else
f:=f^.suiv ;
end;
if (c>=1) then
begin
for i:=0 to c do
e:=e^.suiv ;
q:=q^.suiv ;
while (e^.suiv<>nil) do
begin
e:=e^.suiv ;
a:=a^.suiv ;
end;
if (tete^.inf = s) then 
begin
 tete:=tete^.suiv ;
 dispose(d) ;
end
else 
if  (s=e^.inf) then
begin
a^.suiv := nil ;
dispose(e);
end
else
while (q^.suiv <> nil) do 
if (q^.inf = s ) then 
begin 
b:=q;
q:=q^.suiv ;
d^.suiv := q ;
dispose(b) ;
end
else 
begin
q:=q^.suiv ;
d:=d^.suiv ;
end;
end
else
writeln('this value does"t exist');
end;
BEGIN
repeat 
writeln('      ************************************************************************');
writeln('      *                                                                      *');
writeln('      *                              MENDJA WADIA                            *');
writeln('      *                                                                      *');
writeln('      *          0- To create the list                                       *');
writeln('      *          1- To display                                               *');
writeln('      *          2- To count the number of elemnt in the list                *');
writeln('      *          3- To add an element in the head                            *');
writeln('      *          4- To add an element in the end of list                     *');
writeln('      *          5- To Add an element to a K possition                       *');
writeln('      *          6- Sort the list in a growing order                         *');
writeln('      *          7- Adds an element to an already sorted list                *');
writeln('      *          8- Delete an element                                        *');
writeln('      *          10- exite                                                   *');
writeln('      *                                                                      *');
writeln('      *                                                                      *');
writeln('      ************************************************************************');
writeln;
write  ('                       your choice : ');read(choix);
begin
if choix = 1 then
affichage
else 
if choix = 2 then
count
else if choix=3 then ajoute_tete 
else if choix = 0 then creation
else if choix = 4 then ajouter_queue
else if choix = 5 then ajouter
else if choix = 6 then trie
else if choix = 7 then ajoute_trie
else if choix = 8 then supp
else if choix = 10 then writeln('program closed')
else writeln('your choice is false ');
end;
until(choix=10)
end.

Copie le code

Scripted by : MENDJA WADIA

------------------------------------------

doubly linked list pascal doubly linked list pascal example implement linked list in pascal linked list dalam pascal linked list di pascal linked list pada pascal linked list pascal adalah linked list pascal code linked list pascal example linked list pascal tutorial linked list turbo pascal linked lists in pascal linked lists in pascal java linked lists in pascal junior linked lists in pascal key linked lists in pascal object linked lists in pascal objects linked lists in pascal pascals linked lists in pascal query linked lists in pascal questions linked lists in pascal quote linked lists in pascal quotes linked lists in pascal update linked lists in pascal value linked lists in pascal word linked lists in pascal wordpress linked lists in pascal youtube linked lists in pascal zone

بقلم وديع منجاالوفي للمعلوميات

الوفي للمعلوميات: مدونة تضم عدد كبير من الدروس المكتوبة و الفيديوهات المصورة عن طريق حلقات متسلسلة نتطرق فيها إلى مختلف المواضيع التقنية و التعليمية بشكل عام القريبة من الشباب العربي ، .،