Informatica

{ compiler directive above) to optimize execution speed. }

const
max = 10;

type
list = array[1..max] of integer;

var
data: list;
i: integer;

{ QUICKSORT sorts elements in the array A with indices between }
{ LO and HI (both inclusive). Note that the QUICKSORT proce- }
{ dure

program verifica_presenza ;
var x,i :integer;
z :boolean;
a :array [1..10] of integer;
begin
i:=1;
z:=false;
write ('Inserisci il numero da ricercare, x= ');
readln(x);
writeln ('Inserisci la sequenza di numeri ');
for i:=1 to 10 do
begin
readln(...

program area_triangolo;
var a,b,c,p,area:real;
begin
writeln('inserisci a b c');
read (a,b,c);
if c >= (a+b)
then begin
write('Il triangolo non esiste');
end;
if c*c (a*a+b*b)
then begin
p:=(a+b+c)/2 ; (*semiper....