Pascal

[PettitScarabay]

Uses Crt;
const e=0.01;
Var a,b,alfa,beta:array[1..100] of real;
q,t,x:real;
k:integer;
 
function f(x:real):real;
begin
f:=sqr(x);
end;
 
begin
Clrscr;
k:=1;
write('vvedite konstanty razlichimosti >0 q=');
readln(q);
write('vvedite interval a=');
readln(a[1]);
write('vvedite interval b=');
readln(b[1]);
while (b[k]-a[k]) > e do
begin
alfa[k]:=((b[k]+a[k])/2)-q;
beta[k]:=((b[k]+a[k])/2)+q;
if f(alfa[k]) > f(beta[k]) then
begin
a[k+1]:=alfa[k];
b[k+1]:=b[k];
end
else
begin
a[k+1]:=a[k];
b[k+1]:=beta[k];
end;
k:=k+1;
end;
begin
x:=(a[k]+b[k])/2;
end;
writeln('x=',x:5:3,'  f(x)=',f(x):5:3);
readkey
end.

ИЛИ

uses crt;
const q=0.618;
 
function f(x: real): real;
begin
f:=sqr(x)*x-x+exp(-x);
end;
 
var a, alfa, b, beta:array[1..100] of real;
x, e: real;
k:integer;
begin clrscr;
k:=1;
write('vvedite tochnost >0 e=');
readln(e);
write('vvedite interval a=');
readln(a[1]);
write('vvedite interval b=');
readln(b[1]);
while (b[k]-a[k])>e do
begin
alfa[1]:=a[1]+(1-q)*(b[1]-a[1]);
beta[1]:=a[1]+q*(b[1]-a[1]);
if f(alfa[k])>f(beta[k]) then
begin
a[k+1]:=alfa[k];
b[k+1]:=b[k];
alfa[k+1]:=beta[k];
beta[k+1]:=a[k+1]+q*(b[k+1]-a[k+1]);
writeln ('f(beta[k+1])=',f(beta[k+1]):0:4);
end
else
begin
a[k+1]:=a[k];
b[k+1]:=beta[k];
beta[k+1]:=alfa[k];
alfa[k+1]:=a[k+1]+(1-q)*(b[k+1]-a[k+1]);
writeln ('f(alfa[k+1])=',f(alfa[k+1]):0:4);
end;
k:=k+1;
end;
x:=(a[k]+b[k])/2;
writeln ('x=',x:5:3,' f(x)=',f(x):5:3);
readkey
end.

[Sciv]

Попробую угадать: второй код правильный?