{Programma kas izvada skaitljus dilstoshaa seciibaa ar Burbulja un Hoara metodem. Intervaals [-100;100]} uses crt; const n=100; type masiv=array[1..n] of integer; var i,j,l:integer; x:masiv; {metod puzyrjka} procedure puzirek(var x:masiv; a:integer); var i,j:integer; procedure oborot(var a,b:integer); var c:integer; begin c:=a; a:=b; b:=c; end; begin for i:=a-1 downto 1 do for j:=1 to i do if x[j]>x[j+1] then oborot(x[j], x[j+1]); inc(i); end; {konec} {metod Hoara} procedure hoars(var x:masiv; l, u:integer); var i,j:integer; t:integer; begin while u>l do begin i:=l; j:=u; t:=x[l]; while it do j:=j-1; x[i]:=x[j]; while(i