:
1. , , .
2. , , .
3. .
. .
Const
SIZE=5;
var
a: array[1..SIZE] of integer;
i: integer; { , }
{ }
min: integer; { }
{ i }
j: integer; { -, }
buf: integer; { , }
: integer;
begin
writeln( .);
write(Be ,SIZE:3, );
writeln( <Enter>);
for k:=1 to SIZE do
read(a[k]);
writeln ( );
for i:= 1 to SIZE-1 do
begin
{ a[i] a[SIZE]}
min:=i;
for j:= i + l to SIZE do
begin
if a[j] < a[min] then min:=j;
{ a[min] a[i]}
buf:= a[j];
a[i]:= a[min];
a[min]:= buf;
{ }
for k:=l to SIZE do
write(a[k], );
writeln;
end;
end;
writeln( . );
end.
:
.
5 <Enter>
12 -3 56 47 10
-3 12 56 47 10
-3 10 56 47 12
-3 10 12 47 56
-3 10 12 47 56
.
. , , , . , (), - (), "". , .
1 . ("") , ("") - .
1
. .
Const
SIZE = 5;
var
a: array [l.. SIZE] of integer;
i: integer; { }
k: integer; { }
|
|
|
buf: integer;
begin
writeln(Coppoa .);
write(Be ,SIZE:3, );
writeln( <Enter>);
for k:= l to SIZE do
read(a[k]);
writeln (. );
for i:= l to SIZE-1 do
begin
for k:=l to SIZE-1 do begin
if a[k] > a[ k + l ] then begin
{ k- (+1)- }
buf:= a[k];
a[k]:=a[k+l];
a[k+l]:=buf;
end;
end;
for k:=1 to SIZE do write(a[k], );
writeln;
end;
writeln ( . );
end.
:
.
5 <Enter>
3 2 4 5 1
.
2 3 4 1 5
2 3 1 4 5
2 1 3 4 5
1 2 3 4 5
.
. , , . "", , , .
Uses Crt;
Var
a:array[1..10] of byte;
b, i, p: byte;
Begin
ClrScr;
writeln ( 10 );
For i:=l to 10 do
a[i]:=random(255);
writeln ( : );
For i:=l to 10 do
write(a[i]:7:2);
writeln;
repeat { }
p:=0;
for i:= 1 to 9 do
if a[i] < a[i+l] then
begin
b:=a[i];
a[i]:=a[i+l];
a[i+l]:=b;
p:=l;
end;
until p = 0;
Writeln;
Writeln( : );
for i:=l to 10 do
Writeln(i, - = ,a[i]);
Readln;
End.
, . , , "". .
. - . , , , . , .
. REPEAT, IF naiden TRUE, . , , (naiden=TRUE), . , found , .
var
massiv: array[1..10] of integer; { }
obrazec: integer; { }
naiden: boolean; { }
i: integer;
begin
{ 10 }
writeln ( . );
write(Be 10 );
writeln ( <Enter>);
write(->);
for i:=l to 10 do read(massiv[i]);
{ }
write(Be ( )-> );
readln(obrazec);
{ }
|
|
|
naiden:=FALSE; { }
i:=l; { }
repeat
if massiv[i] = obrazec
then naiden:=TRUE { }
else i:= i+l; { }
until (i>10) or (naiden); { , }
{ }
if naiden then writeln(C , i:3, . . )
else writeln ( . );
end.
:
.
10 <Enter>
->123 45 -17 23 56 2 -8 0 14 324
( )->2
6. .
, , .
, , , .
, . , , , , .
, , , - .
. ( sred), ( 2).
2 .
, .
, ( verh sred).
, ( sred niz).
, , , . (niz-verh)/2+verh.
. verh, niz sred.
var
a:array[1..9] of integer; { }
obrazec:integer; { }
sred, verh, niz: integer; { , }
{ }
naiden: boolean;{ }
n:integer; { }
i: integer;
begin
{ 9 }
writeln( . );
write(Be 9 );
for i:=l to 9 do read(a[i]);
{ }
writeln(BBee ( ) );
readln (obrazec);
{ }
verh:=l;
niz:= 9;
naiden:= FALSE;
n:=0;
writeln( verh niz sred);
repeat
sred:=(niz-verh) div 2 +verh;
writeln (verh:6,niz:6, sred:6);
n:=n+l;
if a[sred] = obrazec then naiden:=TRUE
else begin
if obrazec<a[sred] then niz:=sred-l
else verh:= sred+l;
end;
until (verh>niz) or naiden;
if naiden then write(Co c ,sred,
. ,n, . )
else writeln(pa . );
readln;
end.
:
.
9 <Enter>
-5 -1 0 2 13 44 70 75 91
( ) 70
verh niz sred
1 9 5
6 9 7
7. 2 .
