PHOTO

ngi nh s t 1 ti
Th t chun (Mt hon v ca dy s )
5 ln:
ngi c xp theo th t chun
Mt s ngi chy ra khi dy v sau ng chn vo
nhng v tr bt k to thnh dy mi (xu)

Khng ngi no chy ra khi dy 2 ln

Yu cu: Cho 5 dy xu, tm dy chun

Thut ton sp xp so snh

Thut ton sp xp: Xp th t cc phn t da vo php so
snh gi tr hai phn t
Mc ch: Xc nh phn t no ng trc, phn t no ng
sau
V d: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort,
QuickSort, Heap Sort, Merge Sort,
Nhng thut ton nh Counting Sort, Radix Sort khng phi
thut ton sp xp so snh.
2

V d: Sp xp tng dn
for i := 1 to n do
for j := i + 1 to n do
if a[j] < a[i] then
begin
temp := a[i]; a[i] := a[j];
a[j] := temp;
end;
3

V d: Sp xp tng dn
function Less(x, y:
Integer)
: Boolean;
begin
Tr v True nu
x phi ng trc y
khi sp xp

end;

for i := 1 to n do
for j := i + 1 to n
do
if Less(a[j],
a[i]) then
begin
temp := a[i];
a[i] := a[j];
a[j] := temp;

PHOTO
ngi nh s t 1 ti
Th t chun (Mt hon v ca dy s )
5 ln:
ngi c xp theo th t chun
Mt s ngi chy ra khi dy v sau ng chn vo
nhng v tr bt k to thnh dy mi (xu)

Khng ngi no chy ra khi dy 2 ln

Yu cu: Cho 5 dy xu, tm dy chun

Th t ngi trong nh
Xy dng mng : l
v tr ngi trong nh
1.
2.
3.
4.
5.

1
2
3
1
1

5
4
5
3
7

7
6
7
7
3

8
1
9
5
5

9
3
2
9
9

2
5
4
2
2

4
7
6
4
4

3
9
8
6
6

6
8
1
8
8

for k := 1 to 5 do
for j := 1 to n
do
begin
Input i;
p[i, k] :=
j;
end;
6

PHOTO
Th t chun

nh xu

nh xu

C ti a 2/5 nh x ng sau y
C ti thiu 3/5 nh x ng trc y

V d: Sp xp tng dn
function Less(x, y:
Integer)
: Boolean;
begin

Tr v True nu
t nht 3 gi tr sao
cho

end;

for i := 1 to n do
for j := i + 1 to n
do
if Less(a[j],
a[i]) then
begin
temp := a[i];
a[i] := a[j];
a[j] := temp;