Какие проблемы решает теория алгоритмов?

1 input a

2 input b

3 input c

20 if a> b then goto 60

30 if b> c then goto 110

40 max=с

50 goto 120

60 if a> c then goto 90

70 max=с

80 goto 120

90 max=a

100 goto 120

110 max=b

120 if a< b then goto 160

130 if b< c then goto 210

140 min=с

150 goto 220

160 if a< c then goto 190

170 min=с

180 goto 220

190 min=a

200 goto 220

210 min=b

220 print min*max

program rrr; uses crt; const n=9; type massiv=array[1..n]of real; var a: massiv; max,sr: integer; procedure vvod(var x: massiv); var i: integer; beginwriteln('wwedite massiv'); for i: =1 to n doreadln(x[i]); end; procedure vivod(x: massiv); var i: integer; beginfor i: =1 to n dowrite(x[i]: 6: 2,' '); end; procedure sred_ar_i_max(x: massiv,var sr,max: real); var sum: real; i: integer; begins: =0; for i: =1 to n doif x[i]> 0 then s: =s+x[i]; end; sr: =s/n; for i: =1 to n doif (x[i]> 0) and max< x[i] then max: =x[i]; end; vvod(a); clrscr; vivod(a); sred_ar_i_max(a,sr,max); writeln('max=',max: 6: 2,'srednee arifmet=',sr: 6: 2); readln; end.