n . ³ . () [1..n] . ̳ . [2..n] n-1 . () .
.
1. m, 10 . ³ . .
- :
:
Program Sort_1;
Uses crt;
Const n=10; { }
Var m: array[1..n] of integer;
min: integer; { }
nom: integer; { }
i,j: integer; { }
Begin clrscr;
writeln(' ',n,' :');
For i:=1 to n do read(m[i]); writeln;
For i:=1 to n-1 do {n-1 }
Begin { - }
min:=m[i];
nom:=i;
For j:=i+1 to n do
If m[j]<min then
Begin min:=m[j];
nom:=j;
End;
m[nom]:=m[i];
m[i]:=min;
End;
writeln('³ :');
for i:=1 to n do
write(m[i],' ');
Readkey
End.
:
10 :
2 5 4 8 7 9 5 6 4 3
³ :
2 3 4 4 5 5 6 7 8 9
2).
( )
n . , , , , . . ϳ . , n-1 . ϳ n-1 .
.
2. m 10- . ³ . .
- :
:
Program Sort_3;
Uses crt;
Const n=10; { }
Var m: array[1..n] of integer;
i,j: integer; { }
|
|
tmp: integer; { }
Begin clrscr;
writeln(' m[',n,']:');
for i:=1 to n do read(m[i]); { }
for i:=1 to n-1 do { }
for j:=i+1 to n do
if m[j]<m[i] then
begin { }
tmp:=m[i];
m[i]:=m[j];
m[j]:=tmp
end; { }
writeln ('³ :');
for i:=1 to n do write(m[i],' ');
Readkey
End.
:
m[10]:
7 5 2 1 6 8 4 3 9 11
³ :
1 2 3 4 5 6 7 8 9 11
m n . : . , . , . n-1 , 䳿:
i - ;
j , ;
- j - , ;
j - .
3. m 10 . ³ . .
- :
:
Program Sort_5;
Uses crt;
Const n=10; { }
Var m:array[1..n] of integer;
i,j,k:integer; { }
tmp: integer; { }
Begin
Clrscr;
writeln(' m[',n,']:');
for i:=1 to n do read(m[i]);
for i:=2 to n do
Begin
tmp:=m[i];
j:=1;
while tmp>m[j] do j:=j+1;
for k:=i-1 downto j do m[k+1]:=m[k];
m[j]:=tmp;
End;
writeln('³ :');
for i:=1 to n do write(m[i],' '); writeln;
Readkey
End.
:
m[10]:
5 3 8 9 7 14 4 2 6 1
³ :
1 2 3 4 5 6 7 8 9 14
4. . ³ . .
- :
:
Program Sort_6;
Uses crt;
Const n = 4; { }
m = 5; { }
Var a: array[1..n,1..m] of integer;
i,j,k: integer; { }
c,t: integer; { }
Begin
clrscr;
writeln('i ',n,x,m,:); writeln;
for i:= 1 to n do
for j:= 1 to m do
read(a[i,j]);
for i:= 1 to n do
if odd(i) then
for j:= 2 to m do
begin
t:= a[i,j];
c:= 1;
while t > a[i,c] do
c:=c+1;
for k:= j-1 downto c do
a[i,k+1]:= a[i,k];
a[i,c]:= t;
end;
writeln('i :');
for i:= 1 to n do
begin
for j:= 1 to m do
write(a[i,j],' ');
writeln;
end;
readkey
End.
:
|
|
54
3 1 9 6 8
6 5 9 0 1
5 8 9 1 5
8 9 4 7 1
³ :
1 3 6 8 9
6 5 9 0 1
1 5 5 8 9
8 9 4 7 1
1. ?
2. ?
3. ?
4. ?
5. ?
6. , .