:
, 1 - ,
A[i]>A[i+1]
,
X:=A[i];
A[i]:=A[i+1];
A[i+1]:=X;
N-- .
N - ( ). , N-1 - .
N-1 .
:
Program Obmen;
Var K,I,J,Buf:Integer;
A: array[1..20] of Integer;
begin
For K:=1 to N-1 do { }
{* *}
For I:=1 to N-K do
begin
If A[I] > A[I+1] then
begin
Buf:=A[I];
A[I]:= A[I+1];
A[I+1]:=Buf
end
end
end.
) ( ).
: , . ., . , (min max) .
:
a[1], a[2],, a[n] .
Program Vibor;
Var I,J,Buf:Integer;
A: array[1..20] of Integer;
begin
For I:=1 to N-1 do
For J:=I+1 to N do
If A[J] < A[I] then
begin
Buf:=A[I];
A[I]:= A[J];
A[J =Buf]
end
end.
) ().
: . , . , .
:
j - d: d:=A[j];
j - , . . , i - ^ A[i+1]:=A[i];, i:=i-1;, d<A[i];
Program Vstavka;
Var I,J,D:integer;
A: array[1..20] of Integer;
Begin
For J:=2 to N do
Begin
{**** ****}
D:=A[J];
I:=J-1;
{**** ****}
while d<A[i] do
begin
A[i+1]:=A[i];
i:=i-1;
end;
{**** ****}
|
|
|
A[i+1]:=d;
End;
End.
) (: ).
: . , . , .
:
) .
Program Drobinka;
Var I,J,Q:integer;
F: array[1..20] of Integer;
begin
For I:=1 to N-1 do
For J:=1 to N-I do
begin
If F[J]>F[J+1] then
begin
Q:=F[J];
F[J]:=F[J+1];
F[J+1]:=Q;
end
{end If}
end;
{end For J}
{end For I}
end.
)
Program Drobinka_Flag;
Var I,J,Q:Integer;
F: array[1..20] of Integer;
Flag:Boolean;
begin
For I:=1 to N-1 do
begin
Flag:=True;
For J:=1 to N-I do
begin
If F[J]>F[J+1] then
begin
Q:=F[J];
F[J]:=F[J+1];
F[J+1]:=Q;
Flag:=False
end
{end If}
end;
{end For J}
If Flag=True then break
{end If Flag...}
end;
{end For I}
end.
