Data Structure and Algorithms - Ebook PDF

MUC LUC
Muc Trang
CHNG 1: TONG QUAN VE CAU TRUC D LIEU & GT ...........3
1.1. Tam quan trong cua CTDL & GT trong mot e an tin hoc ........................ 3
1.1.1. Xay dng cau truc d lieu ......................................................................... 3
1.1.2. Xay dng giai thuat ................................................................................... 3
1.1.3. Moi quan he gia cau truc d lieu va giai thuat ....................................... 3
1.2. anh gia Cau truc d lieu & Giai thuat ....................................................... 3
1.2.1. Cac tieu chuan anh gia cau truc d lieu ................................................. 3
1.2.2. anh gia o phc tap cua thuat toan ........................................................ 4
1.3. Kieu d lieu ..................................................................................................... 4
1.3.1. Khai niem ve kieu d lieu .......................................................................... 4
1.3.2. Cac kieu d lieu c s ............................................................................... 4
1.3.3. Cac kieu d lieu co cau truc...................................................................... 5
1.3.4. Kieu d lieu con tro ................................................................................... 5
1.3.5. Kieu d lieu tap tin.................................................................................... 5
Cau hoi va bai tap ................................................................................................. 6
CHNG 2: KY THUAT TM KIEM (Searching) .............................8

2.1. Khai quat ve tm kiem .................................................................................... 8
2.2. Cac giai thuat tm kiem noi ........................................................................... 8
2.2.1. at van e ................................................................................................. 8
2.2.2. Tm tuyen tnh............................................................................................ 8
2.2.3. Tm nh phan ............................................................................................ 10
2.3. Cac giai thuat tm kiem ngoai ..................................................................... 14
2.3.1. at van e ............................................................................................... 14
2.3.2. Tm tuyen tnh.......................................................................................... 14
2.3.3. Tm kiem theo ch muc ............................................................................. 16
Cau hoi va bai tap ............................................................................................... 17
CHNG 3: KY THUAT SAP XEP (SORTING) .............................19

3.1. Khai quat ve sap xep .................................................................................... 19
3.2. Cac giai thuat sap xep noi ............................................................................ 19
3.2.1 Sap xep bang phng phap oi cho .......................................................... 20
3.2.2. Sap xep bang phng phap chon ............................................................. 28
3.2.3. Sap xep bang phng phap chen ............................................................. 33
3.2.4. Sap xep bang phng phap tron .............................................................. 40
3.3. Cac giai thuat sap xep ngoai ........................................................................ 60
3.3.1. Sap xep bang phng phap tron .............................................................. 60
3.3.2. Sap xep theo ch muc ............................................................................... 79
Cau hoi va bai tap ............................................................................................... 82
Giao trnh: Cau Truc D Lieu va Giai Thuat
CHNG 4: DANH SACH (LIST).....................................................84
4.1. Khai niem ve danh sach ............................................................................... 84
4.2. Cac phep toan tren danh sach..................................................................... 84
4.3. Danh sach ac ............................................................................................... 85
4.3.1. nh ngha............................................................................................... 85
4.3.2. Bieu dien danh sach ac .......................................................................... 85
4.3.3. Cac thao tac tren danh sach ac ............................................................. 85
4.3.4. u nhc iem va ng dung ................................................................... 91
4.4. Danh sach lien ket ........................................................................................ 92
4.4.1. nh ngha............................................................................................... 92
4.4.2. Danh sach lien ket n ............................................................................ 92
4.4.3. Danh sach lien ket kep .......................................................................... 111
4.4.4. u nhc iem cua danh sach lien ket .................................................. 135
4.5. Danh sach han che...................................................................................... 135
4.5.1. Hang i ................................................................................................ 135
4.5.2. Ngan xep ............................................................................................... 142
4.5.3. ng dung cua danh sach han che.......................................................... 147
Cau hoi va bai tap ............................................................................................. 147
CHNG 5: CAY (TREE) ............................................................... 149

5.1. Khai niem Bieu dien cay ......................................................................... 149
5.1.1. nh ngha cay ...................................................................................... 149
5.1.2. Mot so khai niem lien quan ................................................................... 149
5.1.3. Bieu dien cay ......................................................................................... 151
5.2. Cay nh phan ............................................................................................... 152
5.2.1. nh ngha............................................................................................. 152
5.2.2. Bieu dien va Cac thao tac ..................................................................... 152
5.2.3. Cay nh phan tm kiem ........................................................................... 163
5.3. Cay can bang............................................................................................... 188
5.3.1. nh ngha Cau truc d lieu ............................................................... 188
5.3.2. Cac thao tac .......................................................................................... 189
Cau hoi va bai tap ............................................................................................. 227
ON TAP (REVIEW).......................................................................... 224

He thong lai cac Cau truc d lieu va cac Giai thuat a hoc .......................... 224
Cau hoi va Bai tap on tap tong hp ................................................................. 227
TAI LIEU THAM KHAO ................................................................. 229
By Ht thuc l c hi cho sc khe at 9:19 pm, Jun 25, 2007
Trang: 2
Chng 1: TONG QUAN VE CAU TRUC D LIEU VA GIAI THUAT
1.1. Tam quan trong cua cau truc d lieu va giai thuat trong mot
e an tin hoc
1.1.1. Xay dng cau truc d lieu
Co the noi rang khong co mot chng trnh may tnh nao ma khong co d lieu e x ly.
D lieu co the la d lieu a vao (input data), d lieu trung gian hoac d lieu a ra
(output data). Do vay, viec to chc e lu tr d lieu phuc vu cho chng trnh co y
ngha rat quan trong trong toan bo he thong chng trnh. Viec xay dng cau truc d
lieu quyet nh rat ln en chat lng cung nh cong sc cua ngi lap trnh trong viec
thiet ke, cai at chng trnh.
1.1.2. Xay dng giai thuat
Khai niem giai thuat hay thuat giai ma nhieu khi con c goi la thuat toan dung e ch
phng phap hay cach thc (method) e giai quyet van e. Giai thuat co the c minh
hoa bang ngon ng t nhien (natural language), bang s o (flow chart) hoac bang ma
gia (pseudo code). Trong thc te, giai thuat thng c minh hoa hay the hien bang
ma gia ta tren mot hay mot so ngon ng lap trnh nao o (thng la ngon ng ma
ngi lap trnh chon e cai at thuat toan), chang han nh C, Pascal,
Khi a xac nh c cau truc d lieu thch hp, ngi lap trnh se bat au tien hanh
xay dng thuat giai tng ng theo yeu cau cua bai toan at ra tren c s cua cau truc
d lieu a c chon. e giai quyet mot van e co the co nhieu phng phap, do vay
s la chon phng phap phu hp la mot viec ma ngi lap trnh phai can nhac va tnh
toan. S la chon nay cung co the gop phan ang ke trong viec giam bt cong viec
cua ngi lap trnh trong phan cai at thuat toan tren mot ngon ng cu the.
1.1.3. Moi quan he gia cau truc d lieu va giai thuat
Moi quan he gia cau truc d lieu va Giai thuat co the minh hoa bang ang thc:
Cau truc d lieu + Giai thuat = Chng trnh
Nh vay, khi a co cau truc d lieu tot, nam vng giai thuat thc hien th viec the hien
chng trnh bang mot ngon ng cu the ch la van e thi gian. Khi co cau truc d lieu
ma cha tm ra thuat giai th khong the co chng trnh va ngc lai khong the co
Thuat giai khi cha co cau truc d lieu. Mot chng trnh may tnh ch co the c hoan
thien khi co ay u ca Cau truc d lieu e lu tr d lieu va Giai thuat x ly d lieu
theo yeu cau cua bai toan at ra.
1.2. anh gia cau truc d lieu va giai thuat

1.2.1. Cac tieu chuan anh gia cau truc d lieu
e anh gia mot cau truc d lieu chung ta thng da vao mot so tieu ch sau:
- Cau truc d lieu phai tiet kiem tai nguyen (bo nh trong),
Trang: 3
By Ht thuc l c hi cho sc khe at 9:19 pm, Jun 25, 2007

- Cau truc d lieu phai phan anh ung thc te cua bai toan,
- Cau truc d lieu phai de dang trong viec thao tac d lieu.
1.2.2. anh gia o phc tap cua thuat toan
Viec anh gia o phc tap cua mot thuat toan qua khong de dang chut nao. day,
chung ta ch muon c lng thi gian thc hien thuan toan T(n) e co the co s so
sanh tng oi gia cac thuat toan vi nhau. Trong thc te, thi gian thc hien mot
thuat toan con phu thuoc rat nhieu vao cac ieu kien khac nh cau tao cua may tnh,
d lieu a vao, , ay chung ta ch xem xet tren mc o cua lng d lieu a vao
ban au cho thuat toan thc hien.
e c lng thi gian thc hien thuat toan chung ta co the xem xet thi gian thc hien
thuat toan trong hai trng hp:
- Trong trng hp tot nhat: Tmin
- Trong trng hp xau nhat: Tmax
T o chung ta co the c lng thi gian thc hien trung bnh cua thuat toan: Tavg
1.3. Kieu d lieu
1.3.1. Khai niem ve kieu d lieu
Kieu d lieu T co the xem nh la s ket hp cua 2 thanh phan:

- Mien gia tr ma kieu d lieu T co the lu tr: V,
- Tap hp cac phep toan e thao tac d lieu: O.
T = <V, O>
Moi kieu d lieu thng c ai dien bi mot ten (nh danh). Moi phan t d lieu co
kieu T se co gia tr trong mien V va co the c thc hien cac phep toan thuoc tap hp
cac phep toan trong O.
e lu tr cac phan t d lieu nay thng phai ton mot so byte(s) trong bo nh, so
byte(s) nay goi la kch thc cua kieu d lieu.
1.3.2. Cac kieu d lieu c s
Hau het cac ngon ng lap trnh eu co cung cap cac kieu d lieu c s. Tuy vao moi
ngon ng ma cac kieu d lieu c s co the co cac ten goi khac nhau song chung quy
lai co nhng loai kieu d lieu c s nh sau:
- Kieu so nguyen: Co the co dau hoac khong co dau va thng co cac kch thc sau:
+ Kieu so nguyen 1 byte
+ Kieu so nguyen 2 bytes
+ Kieu so nguyen 4 bytes
Kieu so nguyen thng c thc hien vi cac phep toan: O = {+, -, *, /, DIV, MOD, <,
>, <=, >=, =, }
Trang: 4
- Kieu so thc: Thng co cac kch thc sau:
+ Kieu so thc 4 bytes
Kieu so thc thng c thc hien vi cac phep toan: O = {+, -, *, /, <, >, <=, >=, =, }
- Kieu ky t: Co the co cac kch thc sau:
+ Kieu ky t byte
+ Kieu ky t 2 bytes
Kieu ky t thng c thc hien vi cac phep toan: O = {+, -, <, >, <=, >=, =, ORD,
CHR, }
- Kieu chuoi ky t: Co kch thc tuy thuoc vao tng ngon ng lap trnh
Kieu chuoi ky t thng c thc hien vi cac phep toan: O = {+, &, <, >, <=, >=, =,
Length, Trunc, }
- Kieu luan ly: Thng co kch thc 1 byte
Kieu luan ly thng c thc hien vi cac phep toan: O = {NOT, AND, OR, XOR, <, >,
<=, >=, =, }
1.3.3. Cac kieu d lieu co cau truc
Kieu d lieu co cau truc la cac kieu d lieu c xay dng tren c s cac kieu d lieu
a co (co the lai la mot kieu d lieu co cau truc khac). Tuy vao tng ngon ng lap
trnh song thng co cac loai sau:
- Kieu mang hay con goi la day: kch thc bang tong kch thc cua cac phan t
- Kieu ban ghi hay cau truc: kch thc bang tong kch thc cac thanh phan (Field)
1.3.4. Kieu d lieu con tro
Cac ngon ng lap trnh thng cung cap cho chung ta mot kieu d lieu ac biet e lu
tr cac a ch cua bo nh, o la con tro (Pointer). Tuy vao loai con tro gan (near
pointer) hay con tro xa (far pointer) ma kieu d lieu con tro co cac kch thc khac
nhau:
+ Con tro gan: 2 bytes
+ Con tro xa: 4 bytes
1.3.5. Kieu d lieu tap tin
Tap tin (File) co the xem la mot kieu d lieu ac biet, kch thc toi a cua tap tin tuy
thuoc vao khong gian a ni lu tr tap tin. Viec oc, ghi d lieu trc tiep tren tap tin
rat mat thi gian va khong bao am an toan cho d lieu tren tap tin o. Do vay, trong
thc te, chung ta khong thao tac trc tiep d lieu tren tap tin ma chung ta can chuyen
tng phan hoac toan bo noi dung cua tap tin vao trong bo nh trong e x ly.
Trang: 5
Cau hoi va Bai tap
1. Trnh bay tam quan trong cua Cau truc d lieu va Giai thuat oi vi ngi lap trnh?
2. Cac tieu chuan e anh gia cau truc d lieu va giai thuat?
3. Khi xay dng giai thuat co can thiet phai quan tam ti cau truc d lieu hay khong?
Tai sao?
4. Liet ke cac kieu d lieu c s, cac kieu d lieu co cau truc trong C, Pascal?
5. S dung cac kieu d lieu c ban trong C, hay xay dng cau truc d lieu e lu tr
trong bo nh trong (RAM) cua may tnh a thc co bac t nhien n (0 n 100) tren
trng so thc (ai , x R):
n
fn ( x ) =
i=0
aix i
Vi cau truc d lieu c xay dng, hay trnh bay thuat toan va cai at chng trnh e
thc hien cac cong viec sau:
- Nhap, xuat cac a thc.
- Tnh gia tr cua a thc tai gia tr x0 nao o.
- Tnh tong, tch cua hai a thc.
6. Tng t nh bai tap 5. nhng a thc trong trng so hu ty Q (cac he so ai va x la
cac phan so co t so va mau so la cac so nguyen).
7. Cho bang gi tau i t ga Saigon en cac ga nh sau (ga cuoi la ga Ha noi):
TAU I S2 S4 S6 S8 S10 S12 S14 S16 S18 LH2 SN2
HANH TRNH 32 gi 41 gi 41 gi 41 gi 41 gi 41 gi 41 gi 41 gi 41 gi 27gi 10g30
SAIGON I 21g00 21g50 11g10 15g40 10g00 12g30 17g00 20g00 22g20 13g20 18g40
MNG MAN 2g10 15g21 19g53 14g07 16g41 21g04 1g15 3g16 17g35 22g58
THAP CHAM 5g01 18g06 22g47 16g43 19g19 0g08 4g05 6g03 20g19 2g15
NHA TRANG 4g10 6g47 20g00 0g47 18g50 21g10 1g57 5g42 8g06 22g46 5g15
TUY HOA 9g43 23g09 3g39 21g53 0g19 5g11 8g36 10g50 2g10
DIEU TR 8g12 11g49 1g20 5g46 0g00 2g30 7g09 10g42 13g00 4g15
QUANG NGAI 15g41 4g55 9g24 3g24 5g55 11g21 14g35 17g04 7g34
TAM KY 6g11 10g39 4g38 7g10 12g40 16g08 18g21 9g03
A NANG 13g27 19g04 8g29 12g20 6g19 9g26 14g41 17g43 20g17 10g53
HUE 16g21 22g42 12g29 15g47 11g12 14g32 18g13 21g14 23g50 15g10
ONG HA 0g14 13g52 17g12 12g42 16g05 19g38 22g39 1g25
ONG HI 19g15 2g27 15g52 19g46 14g41 17g59 21g38 0g52 3g28
VINH 23g21 7g45 21g00 1g08 20g12 23g50 2g59 7g07 9g20
THANH HOA 10g44 0g01 4g33 23g09 3g33 6g39 9g59 12g20
NINH BNH 12g04 1g28 5g54 0g31 4g50 7g57 11g12 13g51
NAM NH 12g37 2g01 6g26 1g24 5g22 8g29 11g44 14g25
PHU LY 13g23 2g42 7g08 2g02 6g00 9g09 12g23 15g06
EN HA NOI 5g00 14g40 4g00 8g30 3g15 7g10 10g25 13g45 16g20
S dung cac kieu d lieu c ban, hay xay dng cau truc d lieu thch hp e lu tr
bang gi tau tren vao bo nh trong va bo nh ngoai (disk) cua may tnh.
Vi cau truc d lieu a c xay dng tren, hay trnh bay thuat toan va cai at
chng trnh e thc hien cac cong viec sau:
- Xuat ra gi en cua mot tau T0 nao o tai mot ga G0 nao o.
Trang: 6
- Xuat ra gi en cac ga cua mot tau T0 nao o.
- Xuat ra gi cac tau en mot ga G0 nao o.
- Xuat ra bang gi tau theo mau tren.
Lu y:
- Cac o trong ghi nhan tai cac ga o, tau nay khong i en hoac ch i qua ma
khong dng lai.
- Dong HANH TRNH ghi nhan tong so gi tau chay t ga Saigon en ga Ha noi.
8. Tng t nh bai tap 7. nhng chung ta can ghi nhan them thong tin ve oan tau khi
dng tai cac ga ch e tranh tau hay e cho khach len/xuong (cac dong in nghieng
tng ng vi cac ga co khach len/xuong, cac dong khac ch dng e tranh tau).
9. S dung kieu d lieu cau truc trong C, hay xay dng cau truc d lieu e lu tr trong
bo nh trong (RAM) cua may tnh trang thai cua cac cot en giao thong (co 3 en:
Xanh, o, Vang). Vi cau truc d lieu a c xay dng, hay trnh bay thuat toan va
cai at chng trnh e mo phong (minh hoa) cho hoat ong cua 2 cot en tren hai
tuyen ng giao nhau tai mot nga t.
10. S dung cac kieu d lieu c ban trong C, hay xay dng cau truc d lieu e lu tr
trong bo nh trong (RAM) cua may tnh trang thai cua mot ban c CARO co kch
thc MN (0 M, N 20). Vi cau truc d lieu c xay dng, hay trnh bay thuat
toan va cai at chng trnh e thc hien cac cong viec sau:
- In ra man hnh ban c CARO trong trang thai hien hanh.
- Kiem tra xem co ai thang hay khong? Neu co th thong bao Ket thuc, neu khong
co th thong bao Tiep tuc.
Trang: 7
Chng 2: KY THUAT TM KIEM (SEARCHING)
2.1. Khai quat ve tm kiem
Trong thc te, khi thao tac, khai thac d lieu chung ta hau nh luc nao cung phai thc
hien thao tac tm kiem. Viec tm kiem nhanh hay cham tuy thuoc vao trang thai va trat
t cua d lieu tren o. Ket qua cua viec tm kiem co the la khong co (khong tm thay)
hoac co (tm thay). Neu ket qua tm kiem la co tm thay th nhieu khi chung ta con phai
xac nh xem v tr cua phan t d lieu tm thay la au? Trong pham vi cua chng
nay chung ta tm cach giai quyet cac cau hoi nay.
Trc khi i vao nghien cu chi tiet, chung ta gia s rang moi phan t d lieu c
xem xet co mot thanh phan khoa (Key) e nhan dien, co kieu d lieu la T nao o, cac
thanh phan con lai la thong tin (Info) lien quan en phan t d lieu o. Nh vay moi
phan t d lieu co cau truc d lieu nh sau:
typedef struct DataElement
{ T Key;
InfoType Info;
} DataType;
Trong tai lieu nay, khi noi ti gia tr cua mot phan t d lieu chung ta muon noi ti gia
tr khoa (Key) cua phan t d lieu o. e n gian, chung ta gia s rang moi phan t
d lieu ch la thanh phan khoa nhan dien.
Viec tm kiem mot phan t co the dien ra tren mot day/mang (tm kiem noi) hoac dien
ra tren mot tap tin/ file (tm kiem ngoai). Phan t can tm la phan t can thoa man ieu
kien tm kiem (thng co gia tr bang gia tr tm kiem). Tuy thuoc vao tng bai toan cu
the ma ieu kien tm kiem co the khac nhau song chung quy viec tm kiem d lieu
thng c van dung theo cac thuat toan trnh bay sau ay.
2.2. Cac giai thuat tm kiem noi (Tm kiem tren day/mang)
2.2.1. at van e
Gia s chung ta co mot mang M gom N phan t. Van e at ra la co hay khong phan t
co gia tr bang X trong mang M? Neu co th phan t co gia tr bang X la phan t th
may trong mang M?
2.2.2. Tm tuyen tnh (Linear Search)
Thuat toan tm tuyen tnh con c goi la Thuat toan tm kiem tuan t (Sequential
Search).
a. T tng:
Lan lt so sanh cac phan t cua mang M vi gia tr X bat au t phan t au tien
cho en khi tm en c phan t co gia tr X hoac a duyet qua het tat ca cac phan
t cua mang M th ket thuc.
Trang: 8
b. Thuat toan:
B1: k = 1 //Duyet t au mang
B2: IF M[k] X AND k N //Neu cha tm thay va cung cha duyet het mang
B2.1: k++
B2.2: Lap lai B2
B3: IF k N
Tm thay tai v tr k
B4: ELSE
Khong tm thay phan t co gia tr X
B5: Ket thuc
c. Cai at thuat toan:

Ham LinearSearch co prototype:
int LinearSearch (T M[], int N, T X);
Ham thc hien viec tm kiem phan t co gia tr X tren mang M co N phan t. Neu tm
thay, ham tra ve mot so nguyen co gia tr t 0 en N-1 la v tr tng ng cua phan
t tm thay. Trong trng hp ngc lai, ham tra ve gia tr 1 (khong tm thay). Noi
dung cua ham nh sau:
int LinearSearch (T M[], int N, T X)
{ int k = 0;
while (M[k] != X && k < N)
k++;
if (k < N)
return (k);
return (-1);
}
d. Phan tch thuat toan:

- Trng hp tot nhat khi phan t au tien cua mang co gia tr bang X:
So phep gan: Gmin = 1
So phep so sanh: Smin = 2 + 1 = 3
- Trng hp xau nhat khi khong tm thay phan t nao co gia tr bang X:
So phep gan: Gmax = 1
So phep so sanh: Smax = 2N+1
- Trung bnh:
So phep gan: Gavg = 1
So phep so sanh: Savg = (3 + 2N + 1) : 2 = N + 2
e. Cai tien thuat toan:

Trong thuat toan tren, moi bc lap chung ta can phai thc hien 2 phep so sanh e
kiem tra s tm thay va kiem soat s het mang trong qua trnh duyet mang. Chung ta
co the giam bt 1 phep so sanh neu chung ta them vao cuoi mang mot phan t cam
canh (sentinel/stand by) co gia tr bang X e nhan dien ra s het mang khi duyet
mang, khi o thuat toan nay c cai tien lai nh sau:
Trang: 9
B1: k = 1
B2: M[N+1] = X //Phan t cam canh
B3: IF M[k] X
B3.1: k++
B3.2: Lap lai B3
B4: IF k < N
Tm thay tai v tr k
B5: ELSE //k = N song o ch la phan t cam canh
B6: Ket thuc
Ham LinearSearch c viet lai thanh ham LinearSearch1 nh sau:
int LinearSearch1 (T M[], int N, T X)
{ int k = 0;
M[N] = X;
while (M[k] != X)
k++;
if (k < N)
return (k);
return (-1);
}
f. Phan tch thuat toan cai tien:

- Trng hp tot nhat khi phan t au tien cua mang co gia tr bang X:
So phep so sanh: Smax = (N+1) + 1 = N + 2
- Trung bnh:
So phep so sanh: Savg = (2 + N + 2) : 2 = N/2 + 2
- Nh vay, neu thi gian thc hien phep gan khong ang ke th thuat toan cai tien se
chay nhanh hn thuat toan nguyen thuy.
2.2.3. Tm nh phan (Binary Search)
Thuat toan tm tuyen tnh to ra n gian va thuan tien trong trng hp so phan t cua
day khong ln lam. Tuy nhien, khi so phan t cua day kha ln, chang han chung ta tm
kiem ten mot khach hang trong mot danh ba ien thoai cua mot thanh pho ln theo
thuat toan tm tuan t th qua thc mat rat nhieu thi gian. Trong thc te, thong thng
cac phan t cua day a co mot th t, do vay thuat toan tm nh phan sau ay se rut
ngan ang ke thi gian tm kiem tren day a co th t. Trong thuat toan nay chung ta
gia s cac phan t trong day a co th t tang (khong giam dan), tc la cac phan t
ng trc luon co gia tr nho hn hoac bang (khong ln hn) phan t ng sau no.
Khi o, neu X nho hn gia tr phan t ng gia day (M[Mid]) th X ch co the tm
Trang: 10
thay na au cua day va ngc lai, neu X ln hn phan t M[Mid] th X ch co the tm
thay na sau cua day.
a. T tng:
Pham vi tm kiem ban au cua chung ta la t phan t au tien cua day (First = 1)
cho en phan t cuoi cung cua day (Last = N).
So sanh gia tr X vi gia tr phan t ng gia cua day M la M[Mid].
Neu X = M[Mid]: Tm thay
Neu X < M[Mid]: Rut ngan pham vi tm kiem ve na au cua day M (Last = Mid1)
Neu X > M[Mid]: Rut ngan pham vi tm kiem ve na sau cua day M (First = Mid+1)
Lap lai qua trnh nay cho en khi tm thay phan t co gia tr X hoac pham vi tm
kiem cua chung ta khong con na (First > Last).
b. Thuat toan e quy (Recursion Algorithm):

B1: First = 1
B2: Last = N
B3: IF (First > Last) //Het pham vi tm kiem
B3.1: Khong tm thay
B3.2: Thc hien Bkt
B4: Mid = (First + Last)/ 2
B5: IF (X = M[Mid])
B5.1: Tm thay tai v tr Mid
B5.2: Thc hien Bkt
B6: IF (X < M[Mid])
Tm e quy t First en Last = Mid 1
B7: IF (X > M[Mid])
Tm e quy t First = Mid + 1 en Last
Bkt: Ket thuc
c. Cai at thuat toan e quy:

Ham BinarySearch co prototype:
int BinarySearch (T M[], int N, T X);
Ham thc hien viec tm kiem phan t co gia tr X trong mang M co N phan t a co
th t tang. Neu tm thay, ham tra ve mot so nguyen co gia tr t 0 en N-1 la v tr
tng ng cua phan t tm thay. Trong trng hp ngc lai, ham tra ve gia tr 1
(khong tm thay). Ham BinarySearch s dung ham e quy RecBinarySearch co
prototype:
int RecBinarySearch(T M[], int First, int Last, T X);
Ham RecBinarySearch thc hien viec tm kiem phan t co gia tr X tren mang M
trong pham vi t phan t th First en phan t th Last. Neu tm thay, ham tra ve
mot so nguyen co gia tr t First en Last la v tr tng ng cua phan t tm thay.
Trong trng hp ngc lai, ham tra ve gia tr 1 (khong tm thay). Noi dung cua cac
ham nh sau:
Trang: 11
int RecBinarySearch (T M[], int First, int Last, T X)
{ if (First > Last)
return (-1);
int Mid = (First + Last)/2;
if (X == M[Mid])
return (Mid);
if (X < M[Mid])
return(RecBinarySearch(M, First, Mid 1, X));
else
return(RecBinarySearch(M, Mid + 1, Last, X));
}
//=======================================================
int BinarySearch (T M[], int N, T X)
{ return (RecBinarySearch(M, 0, N 1, X));
}
d. Phan tch thuat toan e quy:

- Trng hp tot nhat khi phan t gia cua mang co gia tr bang X:
So phep so sanh: Smin = 2
So phep gan: Gmax = log2N + 1
So phep so sanh: Smax = 3log2N + 1
- Trung bnh:
So phep gan: Gavg = log2N + 1
So phep so sanh: Savg = (3log2N + 3)
e. Thuat toan khong e quy (Non-Recursion Algorithm):

B1: First = 1
B2: Last = N
B3: IF (First > Last)
B3.1: Khong tm thay
B3.2: Thc hien Bkt
B4: Mid = (First + Last)/ 2
B5: IF (X = M[Mid])
B5.1: Tm thay tai v tr Mid
B5.2: Thc hien Bkt
B6: IF (X < M[Mid])
B6.1: Last = Mid 1
B6.2: Lap lai B3
B7: IF (X > M[Mid])
B7.1: First = Mid + 1
B7.2: Lap lai B3
Bkt: Ket thuc
Trang: 12
f. Cai at thuat toan khong e quy:
Ham NRecBinarySearch co prototype: int NRecBinarySearch (T M[], int N, T X);
Ham thc hien viec tm kiem phan t co gia tr X trong mang M co N phan t a co
th t tang. Neu tm thay, ham tra ve mot so nguyen co gia tr t 0 en N-1 la v tr
tng ng cua phan t tm thay. Trong trng hp ngc lai, ham tra ve gia tr 1
(khong tm thay). Noi dung cua ham NRecBinarySearch nh sau:
int NRecBinarySearch (T M[], int N, T X)
{ int First = 0;
int Last = N 1;
while (First <= Last)
{ int Mid = (First + Last)/2;
if (X == M[Mid])
return(Mid);
if (X < M[Mid])
Last = Mid 1;
else
First = Mid + 1;
}
return(-1);
}
g. Phan tch thuat toan khong e quy:

- Trng hp tot nhat khi phan t gia cua mang co gia tr bang X:
So phep so sanh: Smin = 2
So phep gan: Gmax = 2log2N + 4
So phep so sanh: Smax = 3log2N + 1
- Trung bnh:
So phep gan: Gavg = log2N + 3.5
So phep so sanh: Savg = (3log2N + 3)
h. V du:
Gia s ta co day M gom 10 phan t co khoa nh sau (N = 10):
1 3 4 5 8 15 17 22 25 30
- Trc tien ta thc hien tm kiem phan t co gia tr X = 5 (tm thay):
Lan lap First Last First > Last Mid M[Mid] X= X< X>
M[Mid] M[Mid] M[Mid]
Ban au 0 9 False 4 8 False True False
1 0 3 False 1 3 False False True
3 3 3 False 3 5 True
Trang: 13
Ket qua sau 3 lan lap (e quy) thuat toan ket thuc.
- Bay gi ta thc hien tm kiem phan t co gia tr X = 7 (khong tm thay):
Lan lap First Last First > Last Mid M[Mid] X= X< X>
M[Mid] M[Mid] M[Mid]
Ban au 0 9 False 4 8 False True False
4 4 3 True
Ket qua sau 4 lan lap (e quy) thuat toan ket thuc.
Lu y:
Thuat toan tm nh phan ch co the van dung trong trng hp day/mang a co
th t. Trong trng hp tong quat chung ta ch co the ap dung thuat toan tm
kiem tuan t.
Cac thuat toan e quy co the ngan gon song ton kem bo nh e ghi nhan ma
lenh chng trnh (moi lan goi e quy) khi chay chng trnh, do vay co the
lam cho chng trnh chay cham lai. Trong thc te, khi viet chng trnh neu co
the chung ta nen s dung thuat toan khong e quy.
2.3. Cac giai thuat tm kiem ngoai (Tm kiem tren tap tin)
2.3.1. at van e
Gia s chung ta co mot tap tin F lu tr N phan t. Van e at ra la co hay khong phan
t co gia tr bang X c lu tr trong tap tin F? Neu co th phan t co gia tr bang X la
phan t nam v tr nao tren tap tin F?
2.3.2. Tm tuyen tnh
a. T tng:
Lan lt oc cac phan t t au tap tin F va so sanh vi gia tr X cho en khi oc
c phan t co gia tr X hoac a oc het tap tin F th ket thuc.
b. Thuat toan:
B1: k=0
B2: rewind(F) //Ve au tap tin F
B3: read(F, a) //oc mot phan t t tap tin F
B4: k = k + sizeof(T) //V tr phan t hien hanh (sau phan t mi oc)
B5: IF a X AND !(eof(F))
Lap lai B3
B6: IF (a = X)
Tm thay tai v tr k byte(s) tnh t au tap tin
B7: ELSE
Trang: 14
B8: Ket thuc

Ham FLinearSearch co prototype:
long FLinearSearch (char * FileName, T X);
Ham thc hien tm kiem phan t co gia tr X trong tap tin co ten FileName. Neu tm
thay, ham tra ve mot so nguyen co gia tr t 0 en filelength(FileName) la v tr
tng ng cua phan t tm thay so vi au tap tin (tnh bang byte). Trong trng hp
ngc lai, hoac co loi khi thao tac tren tap tin ham tra ve gia tr 1 (khong tm thay
hoac loi thao tac tren tap tin). Noi dung cua ham nh sau:
long FLinearSearch (char * FileName, T X)
{ FILE * Fp;
Fp = fopen(FileName, rb);
if (Fp == NULL)
return (-1);
long k = 0;
T a;
int SOT = sizeof(T);
while (!feof(Fp))
{ if (fread(&a, SOT, 1, Fp) == 0)
break;
k = k + SOT;
if (a == X)
break;
}
fclose(Fp);
if (a == X)
return (k - SOT);
return (-1);
}

- Trng hp tot nhat khi phan t au tien cua tap tin co gia tr bang X:
So phep gan: Gmin = 1 + 2 = 3
So lan oc tap tin: Dmin = 1
So phep gan: Gmax = N + 2
So phep so sanh: Smax = 2N + 1
So lan oc tap tin: Dmax = N
- Trung bnh:
So phep gan: Gavg = (N + 5)
So lan oc tap tin: Davg = (N + 1)
Trang: 15
2.3.3. Tm kiem theo ch muc (Index Search)
Nh chung ta a biet, moi phan t d lieu c lu tr trong tap tin d lieu F thng co
kch thc ln, ieu nay cung lam cho kch thc cua tap tin F cung kha ln. V vay
viec thao tac d lieu trc tiep len tap tin F se tr nen lau, cha ke s mat an toan cho
d lieu tren tap tin. e giai quyet van e nay, i kem theo mot tap tin d lieu thng co
them cac tap tin ch muc (Index File) e lam nhiem vu ieu khien th t truy xuat d
lieu tren tap tin theo mot khoa ch muc (Index key) nao o. Moi phan t d lieu trong
tap tin ch muc IDX gom co 2 thanh phan: Khoa ch muc va V tr vat ly cua phan t d
lieu co khoa ch muc tng ng tren tap tin d lieu. Cau truc d lieu cua cac phan t
trong tap tin ch muc nh sau:
typedef struct IdxElement
{ T IdxKey;
long Pos;
} IdxType;
Tap tin ch muc luon luon c sap xep theo th t tang cua khoa ch muc. Viec tao
tap tin ch muc IDX se c nghien cu trong Chng 3, trong phan nay chung ta xem
nh a co tap tin ch muc IDX e thao tac.
a. T tng:
Lan lt oc cac phan t t au tap tin IDX va so sanh thanh phan khoa ch muc vi
gia tr X cho en khi oc c phan t co gia tr khoa ch muc ln hn hoac bang X
hoac a oc het tap tin IDX th ket thuc. Neu tm thay th ta a co v tr vat ly cua
phan t d lieu tren tap tin d lieu F, khi o chung ta co the truy cap trc tiep en v
tr nay e oc d lieu cua phan t tm thay.
b. Thuat toan:
B1: rewind(IDX)
B2: read(IDX, ai)
B3: IF ai.IdxKey < X AND !(eof(IDX))
Lap lai B2
B4: IF ai.IdxKey = X
Tm thay tai v tr ai.Pos byte(s) tnh t au tap tin
B5: ELSE
B6: Ket thuc

Ham IndexSearch co prototype:
long IndexSearch (char * IdxFileName, T X);
Ham thc hien tm kiem phan t co gia tr X da tren tap tin ch muc co ten
IdxFileName. Neu tm thay, ham tra ve mot so nguyen co gia tr t 0 en
filelength(FileName)-1 la v tr tng ng cua phan t tm thay so vi au tap tin d
lieu (tnh bang byte). Trong trng hp ngc lai, hoac co loi khi thao tac tren tap tin
ch muc ham tra ve gia tr 1 (khong tm thay). Noi dung cua ham nh sau:
Trang: 16
long IndexSearch (char * IdxFileName, T X)
{ FILE * IDXFp;
IDXFp = fopen(IdxFileName, rb);
if (IDXFp == NULL)
return (-1);
IdxType ai;
int SOIE = sizeof(IdxType);
while (!feof(IDXFp))
{ if (fread(&ai, SOIE, 1, IDXFp) == 0)
break;
if (ai.IdxKey >= X)
break;
}
fclose(IDXFp);
if (ai.IdxKey == X)
return (ai.Pos);
return (-1);
}

- Trng hp tot nhat khi phan t au tien cua tap tin ch muc co gia tr khoa ch
muc ln hn hoac bang X:
So lan oc tap tin: Dmin = 1
- Trng hp xau nhat khi moi phan t trong tap tin ch muc eu co khoa ch muc
nho hn gia tr X:
So phep so sanh: Smax = 2N + 1
So lan oc tap tin: Dmax = N
- Trung bnh:
So lan oc tap tin: Davg = (N + 1)
Cau hoi va Bai tap

1. Trnh bay t tng cua cac thuat toan tm kiem: Tuyen tnh, Nh phan, Ch muc? Cac
thuat toan nay co the c van dung trong cac trng hp nao? Cho v du?
2. Cai at lai thuat toan tm tuyen tnh bang cac cach:
- S dung vong lap for,
- S dung vong lap do while?
Co nhan xet g cho moi trng hp?
Trang: 17
3. Trong trng hp cac phan t cua day a co th t tang, hay cai tien lai thuat toan
tm tuyen tnh? Cai at cac thuat toan cai tien? anh gia va so sanh gia thuat toan
nguyen thuy vi cac thuat toan cai tien.
4. Trong trng hp cac phan t cua day a co th t giam, hay trnh bay va cai at lai
thuat toan tm nh phan trong hai trng hp: e quy va Khong e quy?
5. Van dung thuat toan tm nh phan, hay cai tien va cai at lai thuat toan tm kiem da
theo tap tin ch muc? anh gia va so sanh gia thuat toan nguyen thuy vi cac thuat
toan cai tien?
6. S dung ham random trong C e tao ra mot day (mang) M co toi thieu 1.000 so
nguyen, sau o chon ngau nhien (cung bang ham random) mot gia tr nguyen K. Van
dung cac thuat toan tm tuyen tnh, tm nh phan e tm kiem phan t co gia tr K
trong mang M.
Vi cung mot d lieu nh nhau, cho biet thi gian thc hien cac thuat toan.
7. Trnh bay va cai at thuat toan tm tuyen tnh oi vi cac phan t tren mang hai
chieu trong hai trng hp:
- Khong s dung phan t Cam canh.
- Co s dung phan t Cam canh.
Cho biet thi gian thc hien cua hai thuat toan trong hai trng hp tren.
8. S dung ham random trong C e tao ra toi thieu 1.000 so nguyen va lu tr vao mot
tap tin co ten SONGUYEN.DAT, sau o chon ngau nhien (cung bang ham random)
mot gia tr nguyen K. Van dung thuat toan tm tuyen tnh e tm kiem phan t co gia
tr K trong tap tin SONGUYEN.DAT.
9. Thong tin ve moi nhan vien bao gom: Ma so la mot so nguyen dng, Ho va em
la mot choi co toi a 20 ky t, Ten nhan vien la mot chuoi co toi a 10 ky t,
Ngay, Thang, Nam sinh la cac so nguyen dng, Phai La Nam hoac N, He
so lng, Lng can ban, Phu cap la cac so thc. Viet chng trnh nhap vao danh
sach nhan vien (t nhat la 10 ngi, khong nhap trung ma gia cac nhan vien vi
nhau) va lu tr danh sach nhan vien nay vao mot tap tin co ten NHANSU.DAT, sau
o van dung thuat toan tm tuyen tnh e tm kiem tren tap tin NHANSU.DAT xem co
hay khong nhan vien co ma la K (gia tr cua K co the nhap vao t ban phm hoac
phat sinh bang ham random). Neu tm thay nhan vien co ma la K th in ra man hnh
toan bo thong tin ve nhan vien nay.
10. Vi tap tin d lieu co ten NHANSU.DAT trong bai tap 9, thc hien cac yeu cau sau:
- Tao mot bang ch muc theo Ten nhan vien.
- Tm kiem tren bang ch muc xem trong tap tin NHANSU.DAT co hay khong nhan
vien co ten la X, neu co th in ra toan bo thong tin ve nhan vien nay.
- Lu tr bang ch muc nay vao trong tap tin co ten NSTEN.IDX.
- Van dung thuat toan tm kiem da tren tap tin ch muc NSTEN.IDX e tm xem co
hay khong nhan vien co ten la X trong tap tin NHANSU.DAT, neu co th in ra toan
bo thong tin ve nhan vien nay.
- Co nhan xet g khi thc hien tm kiem d lieu tren tap tin bang cac phng phap:
Tm tuyen tnh va Tm kiem da tren tap tin ch muc.
Trang: 18
Chng 3: KY THUAT SAP XEP (SORTING)
3.1. Khai quat ve sap xep
e thuan tien va giam thieu thi gian thao tac ma ac biet la e tm kiem d lieu de
dang va nhanh chong, thong thng trc khi thao tac th d lieu tren mang, tren tap
tin a co th t. Do vay, thao tac sap xep d lieu la mot trong nhng thao tac can thiet
va thng gap trong qua trnh lu tr, quan ly d lieu.
Th t xuat hien d lieu co the la th t tang (khong giam dan) hoac th t giam
(khong tang dan). Trong pham vi chng nay chung ta se thc hien viec sap xep d
lieu theo th t tang. Viec sap xep d lieu theo th t giam hoan toan tng t.
Co rat nhieu thuat toan sap xep song chung ta co the phan chia cac thuat toan sap xep
thanh hai nhom chnh can c vao v tr lu tr cua d lieu trong may tnh, o la:
- Cac giai thuat sap xep th t noi (sap xep th t tren day/mang),
- Cac giai thuat sap xep th t ngoai (sap xep th t tren tap tin/file).
Cung nh trong chng trc, chung ta gia s rang moi phan t d lieu c xem xet
co mot thanh phan khoa (Key) e nhan dien, co kieu d lieu la T nao o, cac thanh
phan con lai la thong tin (Info) lien quan en phan t d lieu o. Nh vay moi phan t
d lieu co cau truc d lieu nh sau:
typedef struct DataElement
{ T Key;
InfoType Info;
} DataType;
Trong chng nay noi rieng va tai lieu nay noi chung, cac thuat toan sap xep cua
chung ta la sap xep sao cho cac phan t d lieu co th t tang theo thanh phan khoa
(Key) nhan dien. e n gian, chung ta gia s rang moi phan t d lieu ch la thanh
phan khoa nhan dien.
3.2. Cac giai thuat sap xep noi (Sap xep tren day/mang)
ay, toan bo d lieu can sap xep c a vao trong bo nh trong (RAM). Do vay, so
phan t d lieu khong ln lam do gii han cua bo nh trong, tuy nhien toc o sap xep
tng oi nhanh. Cac giai thuat sap xep noi bao gom cac nhom sau:
- Sap xep bang phng phap em (counting sort),
- Sap xep bang phng phap oi cho (exchange sort),
- Sap xep bang phng phap chon la (selection sort),
- Sap xep bang phng phap chen (insertion sort),
- Sap xep bang phng phap tron (merge sort).
Trong pham vi cua giao trnh nay chung ta ch trnh bay mot so thuat toan sap xep tieu
bieu trong cac thuat toan sap xep cac nhom tren va gia s th t sap xep N phan t
co kieu d lieu T trong mang M la th t tang.
Trang: 19
3.2.1. Sap xep bang phng phap oi cho (Exchange Sort)
Cac thuat toan trong phan nay se tm cach oi cho cac phan t ng sai v tr (so vi
mang a sap xep) trong mang M cho nhau e cuoi cung tat ca cac phan t trong mang
M eu ve ung v tr nh mang a sap xep.
Cac thuat toan sap xep bang phng phap oi cho bao gom:
- Thuat toan sap xep noi bot (bubble sort),
- Thuat toan sap xep lac (shaker sort),
- Thuat toan sap xep giam o tang hay o dai bc giam dan (shell sort),
- Thuat toan sap xep da tren s phan hoach (quick sort).
ay chung ta trnh bay hai thuat toan pho bien la thuat toan sap xep noi bot va sap
xep da tren s phan hoach.
a. Thuat toan sap xep noi bot (Bubble Sort):

- T tng:
+ i t cuoi mang ve au mang, trong qua trnh i neu phan t di (ng pha
sau) nho hn phan t ng ngay tren (trc) no th theo nguyen tac cua bot kh
phan t nhe se b troi len pha tren phan t nang (hai phan t nay se c oi
cho cho nhau). Ket qua la phan t nho nhat (nhe nhat) se c a len (troi len)
tren be mat (au mang) rat nhanh.
+ Sau moi lan i chung ta a c mot phan t troi len ung cho. Do vay, sau N1
lan i th tat ca cac phan t trong mang M se co th t tang.
- Thuat toan:
B1: First = 1
B2: IF (First = N)
Thc hien Bkt
B3: ELSE
B3.1: Under = N
B3.2: If (Under = First)
Thc hien B4
B3.3: Else
B3.3.1: if (M[Under] < M[Under - 1])
Swap(M[Under], M[Under 1]) //oi cho 2 phan t cho nhau
B3.3.2: Under--
B3.3.3: Lap lai B3.2
B4: First++
B5: Lap lai B2
Bkt: Ket thuc
- Cai at thuat toan:
Ham BubbleSort co prototype nh sau:
void BubbleSort(T M[], int N);
Trang: 20
Ham thc hien viec sap xep N phan t co kieu d lieu T tren mang M theo th t
tang da tren thuat toan sap xep noi bot. Noi dung cua ham nh sau:
void BubbleSort(T M[], int N)
{ for (int I = 0; I < N-1; I++)
for (int J = N-1; J > I; J--)
if (M[J] < M[J-1])
Swap(M[J], M[J-1]);
return;
}
Ham Swap co prototype nh sau:
void Swap(T &X, T &Y);
Ham thc hien viec hoan v gia tr cua hai phan t X va Y cho nhau. Noi dung cua
ham nh sau:
void Swap(T &X, T &Y)
{ T Temp = X;
X = Y;
Y = Temp;
return;
}
- V du minh hoa thuat toan:
Gia s ta can sap xep mang M co 10 phan t sau (N = 10):
M: 15 10 2 20 10 5 25 35 22 30
Ta se thc hien 9 lan i (N - 1 = 10 - 1 = 9) e sap xep mang M:
Lan 1: First = 1
J: 2 3 4 5 6 7 8 9 10
M: 15 10 2 20 10 5 25 35 22 30
M: 15 10 2 20 10 5 25 22 35 30
M: 15 10 2 20 10 5 22 25 35 30
M: 15 10 2 20 5 10 22 25 35 30
M: 15 10 2 5 20 10 22 25 35 30
M: 15 2 10 5 20 10 22 25 35 30
Trang: 21
M: 2 15 10 5 20 10 22 25 35 30
Lan 2: First = 2
J: 3 4 5 6 7 8 9 10
M: 2 15 10 5 20 10 22 25 35 30
M: 2 15 10 5 20 10 22 25 30 35
M: 2 15 10 5 10 20 22 25 30 35
M: 2 15 5 10 10 20 22 25 30 35
M: 2 5 15 10 10 20 22 25 30 35
Lan 3: First = 3
J: 4 5 6 7 8 9 10
M: 2 5 15 10 10 20 22 25 30 35
M: 2 5 10 15 10 20 22 25 30 35
Lan 4: First = 4
J: 5 6 7 8 9 10
M: 2 5 10 15 10 20 22 25 30 35
M: 2 5 10 10 15 20 22 25 30 35
Lan 5: First = 5
J: 6 7 8 9 10
M: 2 5 10 10 15 20 22 25 30 35
Lan 6: First = 6
J: 7 8 9 10
M: 2 5 10 10 15 20 22 25 30 35
Trang: 22
Lan 7: First = 7
J: 8 9 10
M: 2 5 10 10 15 20 22 25 30 35
Lan 8: First = 8
J: 9 10
M: 2 5 10 10 15 20 22 25 30 35
Lan 9: First = 9
J: 10
M: 2 5 10 10 15 20 22 25 30 35
Sau 9 lan i mang M tr thanh:

M: 2 5 10 10 15 20 22 25 30 35
- Phan tch thuat toan:
+ Trong moi trng hp:
So phep gan: G = 0
So phep so sanh: S = (N-1) + (N-2) + + 1 = N(N-1)
+ Trong trng hp tot nhat: khi mang ban au a co th t tang
So phep hoan v: Hmin = 0
+ Trong trng hp xau nhat: khi mang ban au a co th t giam
So phep hoan v: Hmin = (N-1) + (N-2) + + 1 = N(N-1)
+ So phep hoan v trung bnh: Havg = N(N-1)
- Nhan xet ve thuat toan noi bot:
+ Thuat toan sap xep noi bot kha n gian, de hieu va de cai at.
+ Trong thuat toan sap xep noi bot, moi lan i t cuoi mang ve au mang th phan t
nhe c troi len rat nhanh trong khi o phan t nang lai chm xuong kha cham
chap do khong tan dung c chieu i xuong (chieu t au mang ve cuoi mang).
+ Thuat toan noi bot khong phat hien ra c cac oan phan t nam hai au cua
mang a nam ung v tr e co the giam bt quang ng i trong moi lan i.
b. Thuat toan sap xep da tren s phan hoach (Partitioning Sort):

Thuat toan sap xep da tren s phan hoach con c goi la thuat toan sap xep
nhanh (Quick Sort).
- T tng:
+ Phan hoach day M thanh 03 day con co th t tng oi thoa man ieu kien:
Day con th nhat (au day M) gom cac phan t co gia tr nho hn gia tr trung
bnh cua day M,
Trang: 23
Day con th hai (gia day M) gom cac phan t co gia tr bang gia tr trung bnh
cua day M,
Day con th ba (cuoi day M) gom cac phan t co gia tr ln hn gia tr trung bnh
cua day M,
+ Neu day con th nhat va day con th ba co nhieu hn 01 phan t th chung ta lai
tiep tuc phan hoach e quy cac day con nay.
+ Viec tm gia tr trung bnh cua day M hoac tm kiem phan t trong M co gia tr bang
gia tr trung bnh cua day M rat kho khan va mat thi gian. Trong thc te, chung
ta chon mot phan t bat ky (thng la phan t ng v tr gia) trong day cac
phan t can phan hoach e lam gia tr cho cac phan t cua day con th hai (day
gia) sau khi phan hoach. Phan t nay con c goi la phan t bien (boundary
element). Cac phan t trong day con th nhat se co gia tr nho hn gia tr phan t
bien va cac phan t trong day con th ba se co gia tr ln hn gia tr phan t bien.
+ Viec phan hoach mot day c thc hien bang cach tm cac cap phan t ng
hai day con hai ben phan t gia (day 1 va day 3) nhng b sai th t (phan t
ng day 1 co gia tr ln hn gia tr phan t gia va phan t ng day 3 co
gia tr nho hn gia tr phan t gia) e oi cho (hoan v) cho nhau.
- Thuat toan:
B1: First = 1
B2: Last = N
B3: IF (First Last) //Day con ch con khong qua 01 phan t
Thc hien Bkt
B4: X = M[(First+Last)/2] //Lay gia tr phan t gia
B5: I = First //Xuat phat t au day 1 e tm phan t co gia tr > X
B6: IF (M[I] > X)
Thc hien B8
B7: ELSE
B7.1: I++
B7.2: Lap lai B6
B8: J = Last //Xuat phat t cuoi day 3 e tm phan t co gia tr < X
B9: IF (M[J] < X)
Thc hien B11
B10: ELSE
B10.1: J--
B10.2: Lap lai B9
B11: IF (I J)
B11.1: Hoan_V(M[I], M[J])
B11.2: I++
B11.3: J--
B11.4: Lap lai B6
B12: ELSE
B12.1: Phan hoach e quy day con t phan t th First en phan t th J
B12.2: Phan hoach e quy day con t phan t th I en phan t th Last
Bkt: Ket thuc
Trang: 24
Ham QuickSort co prototype nh sau:
void QuickSort(T M[], int N);
tang da tren thuat toan sap xep nhanh. Ham QuickSort s dung ham phan hoach e
quy PartitionSort e thc hien viec sap xep theo th t tang cac phan t cua mot day
con gii han t phan t th First en phan t th Last tren mang M. Ham
PartitionSort co prototype nh sau:
void PartitionSort(T M[], int First, int Last);
Noi dung cua cac ham nh sau:
void PartitionSort(T M[], int First, int Last)
{ if (First >= Last)
return;
T X = M[(First+Last)/2];
int I = First;
int J = Last;
do { while (M[I] < X)
I++;
while (M[J] > X)
J--;
if (I <= J)
{ Swap(M[I], M[J]);
I++;
J--;
}
}
while (I <= J);
PartitionSort(M, First, J);
PartitionSort(M, I, Last);
return;
}
//===========================================
void QuickSort(T M[], int N)
{ PartitionSort(M, 0, N-1);
return;
}
M: 45 55 25 20 15 5 25 30 10 3
Ban au: First = 1 Last = 10 X = M[(1+10)/2] =M[5] = 15
First X = 15 Last
M: 45 55 25 20 15 5 25 30 10 3
Phan hoach:
Trang: 25
I X = 15 J
M: 45 55 25 20 15 5 25 30 10 3
I X = 15 J
M: 3 55 25 20 15 5 25 30 10 45
I X = 15 J
M: 3 10 25 20 15 5 25 30 55 45
I X = 15
M: 3 10 5 20 15 25 25 30 55 45
J
First X = 15 I Last
M: 3 10 5 15 20 25 25 30 55 45
J
Phan hoach cac phan t trong day con t First -> J:
First = 1 Last = J = 4 X = M[(1+4)/2] = M[2] = 10
First X = 10 Last
M: 3 10 5 15 20 25 25 30 55 45
Phan hoach:
I X = 10 J
M: 3 10 5 15 20 25 25 30 55 45
X = 10 J
M: 3 10 5 15 20 25 25 30 55 45
I
J X = 10
M: 3 5 10 15 20 25 25 30 55 45
I
First = 1 Last = J = 2 X = M[(1+2)/2] = M[1] = 3
First Last
M: 3 5 10 15 20 25 25 30 55 45
X=3
Trang: 26
Phan hoach:
I J
M: 3 5 10 15 20 25 25 30 55 45
X=3
IJ
M: 3 5 10 15 20 25 25 30 55 45
X=3
J I
M: 3 5 10 15 20 25 25 30 55 45
X=3
First J I Last
M: 3 5 10 15 20 25 25 30 55 45
Phan hoach cac phan t trong day con t I -> Last:

First = I = 3 Last = 4 X = M[(3+4)/2] = M[3] = 10
First Last
M: 3 5 10 15 20 25 25 30 55 45
X = 10
Phan hoach:
I J
M: 3 5 10 15 20 25 25 30 55 45
X = 10
IJ
M: 3 5 10 15 20 25 25 30 55 45
X = 10
J I
M: 3 5 10 15 20 25 25 30 55 45
X = 10
First J I Last
M: 3 5 10 15 20 25 25 30 55 45

First = I = 5 Last = 10 X = M[(5+10)/2] = M[7] = 25
First X = 25 Last
M: 3 5 10 15 20 25 25 30 55 45
Phan hoach:
Trang: 27
I X = 25 J
M: 3 5 10 15 20 25 25 30 55 45
I X = 25
M: 3 5 10 15 20 25 25 30 55 45
J
First X = 25 I Last
M: 3 5 10 15 20 25 25 30 55 45
J
First = 5 Last = J = 6 X = M[(5+6)/2] = M[5] = 20
First Last
M: 3 5 10 15 20 25 25 30 55 45
X = 20
Phan hoach:
I J
M: 3 5 10 15 20 25 25 30 55 45
X = 20
IJ
M: 3 5 10 15 20 25 25 30 55 45
X = 20
J I
M: 3 5 10 15 20 25 25 30 55 45
X = 20
First J I Last
M: 3 5 10 15 20 25 25 30 55 45

First = I = 7 Last = 10 X = M[(7+10)/2] = M[8] = 30
First X = 30 Last
M: 3 5 10 15 20 25 25 30 55 45
Phan hoach:
I X = 30 J
M: 3 5 10 15 20 25 25 30 55 45
IJ
M: 3 5 10 15 20 25 25 30 55 45
Trang: 28
X = 30
J I
M: 3 5 10 15 20 25 25 30 55 45
X = 30
FirstJ I Last
M: 3 5 10 15 20 25 25 30 55 45
X = 30
First = I = 9 Last = 10 X = M[(9+10)/2] = M[9] = 55
First Last
M: 3 5 10 15 20 25 25 30 55 45
X = 55
Phan hoach:
I J
M: 3 5 10 15 20 25 25 30 55 45
X = 55
J I
M: 3 5 10 15 20 25 25 30 45 55
X = 55
M: 3 5 10 15 20 25 25 30 45 55
Toan bo qua trnh phan hoach ket thuc, day M tr thanh:

M: 3 5 10 15 20 25 25 30 45 55

+ Trng hp tot nhat, khi mang M ban au a co th t tang:
So phep gan: Gmin = 1 + 2 + 4 + + 2^[Log2(N) 1] = N-1
So phep so sanh: Smin = NLog2(N)/2
+ Trng hp xau nhat, khi phan t X c chon gia day con la gia tr ln nhat
cua day con. Trng hp nay thuat toan QuickSort tr nen cham chap nhat:
So phep gan: Gmax = 1 + 2 + + (N-1) = N(N-1)/2
So phep so sanh: Smax = (N-1)(N-1)
So phep hoan v: Hmax = (N-1) + (N-2) + + 1 = N(N-1)/2
+ Trung bnh:
So phep gan: Gavg = [(N-1)+N(N-1)/2]/2 = (N-1)(N+2)/4
So phep so sanh: Savg = [NLog2(N)/2 + N(N-1)]/2 = N[Log2(N)+2N2]/4
So phep hoan v: Havg = N(N-1)/4
Trang: 29
3.2.2. Sap xep bang phng phap chon (Selection Sort)
Cac thuat toan trong phan nay se tm cach la chon cac phan t thoa man ieu kien
chon la e a ve ung v tr cua phan t o, cuoi cung tat ca cac phan t trong
mang M eu ve ung v tr.
Cac thuat toan sap xep bang phng phap chon bao gom:
- Thuat toan sap xep chon trc tiep (straight selection sort),
- Thuat toan sap xep da tren khoi/heap hay sap xep tren cay (heap sort).
ay chung ta ch trnh bay thuat toan sap xep chon trc tiep
Thuat toan sap xep chon trc tiep (Straight Selection Sort):
- T tng:
+ Ban au day co N phan t cha co th t. Ta chon phan t co gia tr nho nhat
trong N phan t cha co th t nay e a len au nhom N phan t.
+ Sau lan th nhat chon la phan t nho nhat va a len au nhom chung ta con lai
N-1 phan t ng pha sau day M cha co th t. Chung ta tiep tuc chon phan
t co gia tr nho nhat trong N-1 phan t cha co th t nay e a len au nhom
N-1 phan t. . Do vay, sau N1 lan chon la phan t nho nhat e a len au
nhom th tat ca cac phan t trong day M se co th t tang.
+ Nh vay, thuat toan nay chu yeu chung ta i tm gia tr nho nhat trong nhom N-K
phan t cha co th t ng pha sau day M. Viec nay n gian chung ta van
dung thuat toan tm kiem tuan t.
- Thuat toan:
B1: K = 0
B2: IF (K = N-1)
Thc hien Bkt
B3: Min = M[K+1]
B4: PosMin = K+1
B5: Pos = K+2
B6: IF (Pos > N)
Thc hien B8
B7: ELSE
B7.1: If (Min > M[Pos])
B7.1.1: Min = M[Pos]
B7.1.2: PosMin = Pos
B7.2: Pos++
B7.3: Lap lai B6
B8: HoanV(M[K+1], M[PosMin])
B9: K++
B10: Lap lai B2
Bkt: Ket thuc
Ham SelectionSort co prototype nh sau:
Trang: 30
void SelectionSort(T M[], int N);
tang da tren thuat toan sap xep chon trc tiep. Noi dung cua ham nh sau:
void SelectionSort(T M[], int N)
{ int K = 0, PosMin;
while (K < N-1)
{ T Min = M[K];
PosMin = K;
for (int Pos = K+1; Pos < N; Pos++)
if (Min > M[Pos])
{ Min = M[Pos];
PosMin = Pos
}
Swap(M[K], M[PosMin]);
K++;
}
return;
}
M: 1 60 2 25 15 45 5 30 33 20
Ta se thc hien 9 lan chon la (N - 1 = 10 - 1 = 9) phan t nho nhat e sap xep
mang M:
Lan 1: Min = 1 PosMin = 1 K=0
K+1
M: 1 60 2 25 15 45 5 30 33 20

K+1
M: 1 60 2 25 15 45 5 30 33 20
K+1
M: 1 2 60 25 15 45 5 30 33 20

K+1
M: 1 2 60 25 15 45 5 30 33 20
K+1
M: 1 2 5 25 15 45 60 30 33 20
Trang: 31
K+1
M: 1 2 5 25 15 45 60 30 33 20
K+1
M: 1 2 5 15 25 45 60 30 33 20
Lan 5: Min = 20 PosMin = 10 K = 4

K+1
M: 1 2 5 15 25 45 60 30 33 20
K+1
M: 1 2 5 15 20 45 60 30 33 25
Lan 6: Min = 25 PosMin = 10 K = 5

K+1
M: 1 2 5 15 20 45 60 30 33 25
K+1
M: 1 2 5 15 20 25 60 30 33 45

K+1
M: 1 2 5 15 20 25 60 30 33 45
K+1
M: 1 2 5 15 20 25 30 60 33 45

K+1
M: 1 2 5 15 20 25 30 60 33 45
K+1
M: 1 2 5 15 20 25 30 33 60 45
Lan 9: Min = 45 PosMin = 10 K = 8

K+1
M: 1 2 5 15 20 25 30 33 60 45
Trang: 32
K+1
M: 1 2 5 15 20 25 30 33 45 60
Sau lan 9: K = 9 va mang M tr thanh:

M: 1 2 5 15 20 25 30 33 45 60

So phep so sanh: S = (N-1)+(N-2)++1 = N(N-1)/2
So phep hoan v: H = N-1
So phep gan: Gmin = 2(N-1)
+ Trng hp xau nhat, khi mang M ban au a co th t giam dan:
So phep gan: Gmax = 2[N+(N-1)+ +1] = N(N+1)
+ Trung bnh:
So phep gan: Gavg = [2(N-1)+N(N+1)]/2 = (N-1) + N(N+1)/2
3.2.3. Sap xep bang phng phap chen (Insertion Sort)
Cac thuat toan trong phan nay se tm cach tan dung K phan t au day M a co th t
tang, chung ta em phan t th K+1 chen vao K phan t au day sao cho sau khi chen
chung ta co K+1 phan t au day M a co th t tang.
Ban au day M co t nhat 1 phan t au day a co th t tang (K=1). Nh vay sau toi
a N-1 bc chen la chung ta se sap xep xong day M co N phan t theo th t tang.
Cac thuat toan sap xep bang phng phap chen bao gom:
- Thuat toan sap xep chen trc tiep (straight insertion sort),
- Thuat toan sap xep chen nh phan (binary insertion sort).
Trong tai lieu nay chung ta ch trnh bay thuat toan sap xep chen trc tiep.
Thuat toan sap xep chen trc tiep (Straight Insertion Sort):
- T tng:
e chen phan t th K+1 vao K phan t au day a co th t chung ta se tien hanh
tm v tr ung cua phan t K+1 trong K phan t au bang cach van dung thuat giai
tm kiem tuan t (Sequential Search). Sau khi tm c v tr chen (chac chan co v
tr chen) th chung ta se tien hanh chen phan t K+1 vao ung v tr chen bang cach
di cac phan t t v tr chen en phan t th K sang phai (ra pha sau) 01 v tr va
chen phan t K+1 vao v tr cua no.
- Thuat toan:
B1: K = 1
B2: IF (K = N)
Trang: 33
Thc hien Bkt
B3: X = M[K+1]
B4: Pos = 1
B5: IF (Pos > K)
Thc hien B7
B6: ELSE //Tm v tr chen
B6.1: If (X <= M[Pos])
Thc hien B7
B6.2: Pos++
B6.3: Lap lai B6.1
B7: I = K+1
B8: IF (I > Pos) //Neu con phai di cac phan t t Pos->K ve pha sau 1 v tr
B8.1: M[I] = M[I-1]
B8.2: I--
B8.3: Lap lai B8
B9: ELSE //a di xong cac phan t t Pos->K ve pha sau 1 v tr
B9.1: M[Pos] = X //Chen X vao v tr Pos
B9.2: K++
B9.3: Lap lai B2
Bkt: Ket thuc
Ham InsertionSort co prototype nh sau:
void InsertionSort(T M[], int N);
tang da tren thuat toan sap xep chen trc tiep. Noi dung cua ham nh sau:
void InsertionSort(T M[], int N)
{ int K = 1, Pos;
while (K < N)
{ T X = M[K];
Pos = 0;
while (X > M[Pos])
Pos++;
for (int I = K; I > Pos; I--)
M[I] = M[I-1];
M[Pos] = X;
K++;
}
return;
}
M: 11 16 12 75 51 54 5 73 36 52
Ta se thc hien 9 lan chen (N - 1 = 10 - 1 = 9) cac phan t vao day con a co th t
tang ng au day M:
Trang: 34
Lan 1: K = 1 X = M[K+1] = M[2] = 16 Pos = 2
K: 1
M: 11 16 12 75 51 54 5 73 36 52
X
Lan 2: K = 2 X = M[K+1] = M[3] = 12 Pos = 2
K: 1 2
M: 11 16 12 75 51 54 5 73 36 52
X
K: 1 2
M: 11 12 16 75 51 54 5 73 36 52
X
Lan 3: K = 3 X = M[K+1] = M[4] = 75 Pos = 4
K: 1 2 3
M: 11 12 16 75 51 54 5 73 36 52
X
K: 1 2 3
M: 11 12 16 75 51 54 5 73 36 52
Lan 4: K = 4 X = M[K+1] = M[5] = 51 Pos = 4

K: 1 2 3 4
M: 11 12 16 75 51 54 5 73 36 52
X
K: 1 2 3 4
M: 11 12 16 51 75 54 5 73 36 52
Lan 5: K = 5 X = M[K+1] = M[6] = 54 Pos = 5

K: 1 2 3 4 5
M: 11 12 16 51 75 54 5 73 36 52
X
K: 1 2 3 4 5
M: 11 12 16 51 54 75 5 73 36 52
Trang: 35
Lan 6: K = 6 X = M[K+1] = M[7] = 5 Pos = 1
K: 1 2 3 4 5 6
M: 11 12 16 51 54 75 5 73 36 52
X
K: 1 2 3 4 5 6
M: 5 11 12 16 51 54 75 73 36 52
Lan 7: K = 7 X = M[K+1] = M[8] = 73 Pos = 7

K: 1 2 3 4 5 6 7
M: 5 11 12 16 51 54 75 73 36 52
X
K: 1 2 3 4 5 6 7
M: 5 11 12 16 51 54 73 75 36 52
Lan 8: K = 8 X = M[K+1] = M[9] = 36 Pos = 5

K: 1 2 3 4 5 6 7 8
M: 5 11 12 16 51 54 73 75 36 52
X
K: 1 2 3 4 5 6 7 8
M: 5 11 12 16 36 51 54 73 75 52
X
Lan 9: K = 9 X = M[K+1] = M[10] = 52 Pos = 7

K: 1 2 3 4 5 6 7 8 9
M: 5 11 12 16 36 51 54 73 75 52
X
K: 1 2 3 4 5 6 7 8 9
M: 5 11 12 16 36 51 52 54 73 75
Thuat toan ket thuc: K = 10, mang M a c sap xep theo th t tang
K: 1 2 3 4 5 6 7 8 9 10
M: 5 11 12 16 36 51 52 54 73 75
Trang: 36
So phep gan: Gmin = 2(N-1)
So phep so sanh: Smin = 1+2++(N-1) = N(N-1)/2
+ Trng hp xau nhat, khi mang M ban au luon co phan t nho nhat trong N-K
phan t con lai ng v tr sau cung sau moi lan hoan v:
So phep gan: Gmax = [2(N-1)]+[ 1+2++(N-1)] = [2(N-1)] + [N(N-1)/2]
So phep so sanh: Smax = (N-1)
So phep hoan v: Hmax = 0
+ Trung bnh:
So phep gan: Gavg = 2(N-1) + [N(N-1)/4]
So phep so sanh: Savg = [N(N-1)/2 + (N-1)]/2 = (N+2)(N-1)/4
So phep hoan v: Havg = 0
+ Chung ta nhan thay rang qua trnh tm kiem v tr chen cua phan t K+1 va qua
trnh di cac phan t t v tr chen en K ra pha sau 01 v tr co the ket hp lai
vi nhau. Nh vay, qua trnh di di cac phan t ra sau nay se bat au t phan t
th K tr ve au day M cho en khi gap phan t co gia tr nho hn phan t K+1
th chung ta ong thi va di di xong va ong thi cung bat gap v tr chen.
Ngoai ra, chung ta cung co the tnh toan gia tr ban au cho K tuy thuoc vao so
phan t ng au day M ban au co th t tang la bao nhieu phan t ch khong
nhat thiet phai la 1. Khi o, thuat toan sap xep chen trc tiep cua chung ta co the
c hieu chnh lai nh sau:
- Thuat toan hieu chnh:
B1: K = 1
B2: IF (M[K] <= M[K+1] And K < N)
B2.1: K++
B2.2: Lap lai B2
B3: IF (K = N)
Thc hien Bkt
B4: X = M[K+1]
B5: Pos = K
B6: IF (Pos > 0 And X < M[Pos])
B6.1: M[Pos+1] = M[Pos]
B6.2: Pos--
B6.3: Lap lai B6
B7: ELSE //Chen X vao v tr Pos+1
B7.1: M[Pos+1] = X
B7.2: K++
B7.3: Lap lai B3
Bkt: Ket thuc
- Cai at thuat toan hieu chnh:
Ham InsertionSort1 co prototype nh sau:
Trang: 37
void InsertionSort1(T M[], int N);
tang da tren thuat toan sap xep chen trc tiep a hieu chnh. Noi dung cua ham
nh sau:
void InsertionSort1(T M[], int N)
{ int K = 1, Pos;
while(M[K-1] <= M[K] && K<N)
K++;
while (K < N)
{ T X = M[K];
Pos = K-1;
while (X < M[Pos] && Pos >= 0)
{ M[Pos+1] = M[Pos]; Pos--; }
M[Pos+1] = X;
K++;
}
return;
}
- V du minh hoa thuat toan hieu chnh:
M: 14 16 20 75 50 5 25 75 60 50
Ban au K = 4 nen ta se thc hien 6 lan chen (N - 4 = 10 - 4 = 6) cac phan t vao
day con a co th t tang ng au day M:
Lan 1: K = 4 X = M[K+1] = M[5] = 50 Pos = 3 => Pos + 1 = 4
K: 1 2 3 4
M: 14 16 20 75 50 5 25 75 60 50
X=50
K: 1 2 3 4
M: 14 16 20 75 75 5 25 75 60 50
K: 1 2 3 4
M: 14 16 20 50 75 5 25 75 60 50
X
Lan 2: K = 5 X = M[K+1] = M[6] = 5 Pos = 0 => Pos + 1 = 1
K: 1 2 3 4 5
M: 14 16 20 50 75 5 25 75 60 50
X=5
K: 1 2 3 4 5
M: 14 14 16 20 50 75 25 75 60 50
Trang: 38
K: 1 2 3 4 5
M: 5 14 16 20 50 75 25 75 60 50
Lan 3: K = 6 X = M[K+1] = M[7] = 25 Pos = 4 => Pos + 1 = 5

K: 1 2 3 4 5 6
M: 5 14 16 20 50 75 25 75 60 50
X=25
K: 1 2 3 4 5 6
M: 5 14 16 20 50 50 75 75 60 50
K: 1 2 3 4 5 6
M: 5 14 16 20 25 50 75 75 60 50
X
Lan 4: K = 7 X = M[K+1] = M[8] = 75 Pos = 7 => Pos + 1 = 8

K: 1 2 3 4 5 6 7
M: 5 14 16 20 25 50 75 75 60 50
X=75
K: 1 2 3 4 5 6 7
M: 5 14 16 20 25 50 75 75 60 50
X=75
Lan 5: K = 8 X = M[K+1] = M[9] = 60 Pos = 6 => Pos + 1 = 7
K: 1 2 3 4 5 6 7 8
M: 5 14 16 20 25 50 75 75 60 50
X=60
K: 1 2 3 4 5 6 7 8
M: 5 14 16 20 25 50 75 75 75 50
K: 1 2 3 4 5 6 7 8
M: 5 14 16 20 25 50 60 75 75 50
Lan 6: K = 9 X = M[K+1] = M[10] = 50 Pos = 6 => Pos + 1 = 7

K: 1 2 3 4 5 6 7 8 9
M: 5 14 16 20 25 50 60 75 75 50
Trang: 39
X=50
K: 1 2 3 4 5 6 7 8 9
M: 5 14 16 20 25 50 60 60 75 75
K: 1 2 3 4 5 6 7 8 9
M: 5 14 16 20 25 50 50 60 75 75
Thuat toan ket thuc: K = 10, mang M a c sap xep theo th t tang
K: 1 2 3 4 5 6 7 8 9 10
M: 5 14 16 20 25 50 50 60 75 75
- Phan tch thuat toan hieu chnh:

So phep so sanh: Smin = 2(N-1) + 1
+ Trng hp xau nhat, khi mang M ban au a co th t giam dan:
So phep gan: Gmax = 1+[1+2++(N-1)]+[N-1] = N(N+1)/2
So phep so sanh: Smax = 1+2[1+2++(N-1)]+[N-1] = N2
So phep hoan v: Hmax = 0
+ Trung bnh:
So phep gan: Gavg = [1+ N(N-1)/2]/2
So phep so sanh: Savg = [2(N-1) + 1+N2]/2
3.2.4. Sap xep bang phng phap tron (Merge Sort)
Cac thuat toan trong phan nay se tm cach tach mang M thanh cac mang con theo cac
ng chay (run) roi sau o tien hanh nhap cac mang nay lai theo tng cap ng
chay e tao thanh cac ng chay mi co chieu dai ln hn ng chay cu. Sau mot
so lan tach/nhap th cuoi cung mang M ch con lai 1 ng chay, luc o th cac phan t
tren mang M se tr nen co th t.
Cac thuat toan sap xep bang phng phap tron bao gom:
- Thuat toan sap xep tron thang hay tron trc tiep (straight merge sort),
- Thuat toan sap xep tron t nhien (natural merge sort).
Trc khi i vao chi tiet tng thuat toan chung ta hay tm hieu khai niem va cac van e
lien quan en ng chay (run)
- ng chay (Run):
Day M[I], M[I+1], , M[J] (I J: 1 I, J N) la mot ng chay neu no co th t.
Trang: 40
- Chieu dai cua ng chay (Runs Length):
So phan t cua mot ng chay con c goi la chieu dai cua ng chay.
Nh vay:
+ Moi phan t cua day la mot ng chay co chieu dai bang 1.
+ Mot day co the bao gom nhieu ng chay.
- Tron cac ng chay:
Khi ta tron cac ng chay lai vi nhau se cho ra mot ng chay mi co chieu dai
bang tong chieu dai cac ng chay ban au.
a. Thuat toan sap xep tron trc tiep hay tron thang (Straight Merge Sort):
- T tng:
Ban au day M co N run(s) vi chieu dai moi run: L = 1, ta tien hanh phan phoi luan
phien N run(s) cua day M ve hai day phu Temp1, Temp2 (Moi day phu co N/2
run(s)). Sau o tron tng ng tng cap run hai day phu Temp1, Temp2 thanh mot
run mi co chieu dai L = 2 e a ve M va day M tr thanh day co N/2 run(s) vi
chieu dai moi run: L = 2.
Nh vay, sau moi lan phan phoi va tron cac run tren day M th so run tren day M se
giam i mot na, ong thi chieu dai moi run se tang gap oi. Do o, sau Log2(N)
lan phan phoi va tron th day M ch con lai 01 run vi chieu dai la N va khi o day M
tr thanh day co th t.
Trong thuat giai sau, e de theo doi chung ta trnh bay rieng 02 thuat giai:
+ Thuat giai phan phoi luan phien (tach) cac ng chay vi chieu dai L tren day
M ve cac day phu Temp1, Temp2.
+ Thuat giai tron (nhap) cac cap ng chay tren Temp1, Temp2 co chieu dai L
ve M thanh cac ng chay vi chieu dai 2*L.
- Thuat toan phan phoi:
B1: I = 1 //Ch so tren M
B2: J1 = 1 //Ch so tren Temp1
B4: IF (I > N) //a phan phoi het
Thc hien Bkt
//Chep 1 run t M sang Temp1
B5: K = 1 //Ch so e duyet cac run
B6: IF (K > L) //Duyet het 1 run
Thc hien B13
B7: Temp1[J1] = M[I] //Chep cac phan t cua run tren M sang Temp1
B8: I++
B9: J1++
B10: K++
Thc hien Bkt
B12: Lap lai B6
//Chep 1 run t M sang Temp2
Trang: 41
B13: K = 1
B14: IF (K > L)
Thc hien B21
B15: Temp2[J2] = M[I] //Chep cac phan t cua run tren M sang Temp2
B16: I++
B17: J2++
B18: K++
Thc hien Bkt
B20: Lap lai B14
B21: Lap lai B4
B22: N1 = J1-1 //So phan t tren Temp1
B23: N2 = J2-1 //So phan t tren Temp2
Bkt: Ket thuc
- Thuat toan tron:
B1: I = 1 // Ch so tren M
B4: K1 = 1 //Ch so e duyet cac run tren Temp1
B5: K2 = 1 //Ch so e duyet cac run tren Temp2
B6: IF (J1 > N1) //a chep het cac phan t trong Temp1
Thc hien B25
Thc hien B30
B8: IF (Temp1[J1] Temp2[J2]) //Temp1[J1] ng trc Temp2[J2] tren M
B8.1: M[I] = Temp1[J1]
B8.2: I++
B8.3: J1++
B8.4: K1++
B8.5: If (K1 > L) //a duyet het 1 run trong Temp1
Thc hien B11
B8.6: Lap lai B6
B9: ELSE //Temp2[J2] ng trc Temp1[J1] tren M
B9.1: M[I] = Temp2[J2]
B9.2: I++
B9.3: J2++
B9.4: K2++
B9.5: If (K2 > L) //a duyet het 1 run trong Temp2
Thc hien B18
B9.6: Lap lai B6
B10: Lap lai B4
//Chep phan run con lai trong Temp2 ve M
B11: IF (K2 > L) //a chep het phan run con lai trong Temp2 ve M
Lap lai B4
B12: M[I] = Temp2[J2]
B13: I++
B14: J2++
Trang: 42
B15: K2++
Thc hien B30
B17: Lap lai B11
//Chep phan run con lai trong Temp1 ve M
B18: IF (K1 > L) //a chep het phan run con lai trong Temp1 ve M
Lap lai B4
B19: M[I] = Temp1[J1]
B20: I++
B21: J1++
B22: K1++
B23: IF (J1 > N1)//a chep het cac phan t trong Temp1
Thc hien B25
B24: Lap lai B18
//Chep cac phan t con lai trong Temp2 ve M
B25: IF (J2>N2)
Thc hien Bkt
B26: M[I] = Temp2[J2]
B27: I++
B28: J2++
B29: Lap lai B25
//Chep cac phan t con lai trong Temp1 ve M
B30: IF (J1>N1)
Thc hien Bkt
B31: M[I] = Temp1[J1]
B32: I++
B33: J1++
B34: Lap lai B30
Bkt: Ket thuc
- Thuat toan sap xep tron thang:
B1: L = 1 //Chieu dai ban au cua cac run
B2: IF (L N) //Day ch con 01 run
Thc hien Bkt
B3: Phan_Phoi(M, N, Temp1, N1, Temp2, N2, L)
B4: Tron(Temp1, N1, Temp2, N2, M, N, L)
B5: L = 2*L
B6: Lap lai B2
Bkt: Ket thuc
Ham StraightMergeSort co prototype nh sau:
void StraightMergeSort(T M[], int N);
tang da tren thuat toan sap tron trc tiep. Ham s dung cac ham Distribute, Merge
co prototype va y ngha nh sau:
void Distribute(T M[], int N, T Temp1[], int &N1, T Temp2[], int &N2, int L);
Trang: 43
Ham thc hien viec phan phoi luan phien cac ng chay co chieu dai L tren day M
co N phan t ve thanh cac day Temp1 va Temp2 co tng ng N1 va N2 phan t.
void Merge(T Temp1[], int N1, T Temp2[], int N2, T M[], int &N, int L);
Ham thc hien viec tron tng cap tng ng cac ng chay vi o dai L tren
Temp1, Temp2 ve day M thanh cac ng chay co chieu dai 2*L.
void Distribute(T M[], int N, T Temp1[], int &N1, T Temp2[], int &N2, int L)
{ int I = 0, J1 = 0, J2 = 0;
while (I < N)
{ for(int K = 0; K<L && I<N; K++, I++, J1++)
Temp1[J1] = M[I];
for(K = 0; K<L && I<N; K++, I++, J2++)
Temp2[J2] = M[I];
}
N1 = J1;
N2 = J2;
return;
}
//========================================================
void Merge(T Temp1[], int N1, T Temp2[], int N2, T M[], int &N, int L)
{ int I = 0, J1 = 0, J2 = 0, K1 = 0, K2 = 0;
while (J1 < N1 && J2 < N2)
{ while (Temp1[J1] <= Temp2[J2] && J1 < N1 && J2 < N2)
{ M[I] = Temp1[J1];
I++;
J1++;
if (J1 == N1)
{ for (; J2 < N2; J2++, I++)
M[I] = Temp2[J2];
return;
}
K1++;
if (K1 == L)
{ for (; K2 < L && J2 < N2; K2++, I++, J2++)
M[I] = Temp2[J2];
K1 = K2 = 0;
break;
}
}
while (Temp2[J2] < Temp1[J1] && J1 < N1 && J2 < N2)
{ M[I] = Temp2[J2];
I++;
J2++;
if (J2 == N2)
{ for (; J1 < N1; J1++, I++)
M[I] = Temp1[J1];
Trang: 44
return;
}
K2++;
if (K2 == L)
{ for (; K1 < L && J1 < N1; K1++, I++, J1++)
M[I] = Temp1[J1];
K1 = K2 = 0;
break;
}
}
}
while (J1 < N1)
{ M[I] = Temp1[J1];
I++;
J1++;
}
while (J2 < N2)
{ M[I] = Temp2[J2];
I++;
J2++;
}
N = N1 + N2;
return;
}
//========================================================
void StraightMergeSort(T M[], int N)
{ int L = 1, N1 = 0, N2 = 0;
T * Temp1 = new T[N];
T * Temp2 = new T[N];
if (Temp1 == NULL || Temp2 == NULL)
return;
while (L < N)
{ Distribute(M, N, Temp1, N1, Temp2, N2, L);
Merge(Temp1, N1, Temp2, N2, M, N, L);
L = 2*L;
}
delete Temp1;
delete Temp2;
return;
}
M: 41 36 32 47 65 21 52 57 70 50
Ta thc hien cac lan phan phoi va tron cac phan t cua M nh sau:
Lan 1: L = 1
Trang: 45
Phan phoi M thanh Temp1, Temp2:
M: 41 36 32 47 65 21 52 57 70 50
Temp1:N1=5
41 32 65 52 70
Temp2:N2=5
36 47 21 57 50
Tron Temp1, Temp2 thanh M:

Temp1:N1=5
41 32 65 52 70
Temp2:N2=5
36 47 21 57 50
M: 36 41 32 47 21 65 52 57 50 70
Lan 2: L = 2
M: 36 41 32 47 21 65 52 57 50 70
Temp1: N1=6
36 41 21 65 50 70
Temp2: N2=4
32 47 52 57

Temp1: N1=6
36 41 21 65 50 70
Temp2: N2=4
32 47 52 57
M: 32 36 41 47 21 52 57 65 50 70
Lan 3: L = 4
Trang: 46
M: 32 36 41 47 21 52 57 65 50 70
Temp1:N1=6 32 36 41 47 50 70
Temp2: N2=4 21 52 57 65
Temp1:N1=6 32 36 41 47 50 70
Temp2: N2=4 21 52 57 65
M: 21 32 36 41 47 52 57 65 50 70
Lan 4: L = 8
M: 21 32 36 41 47 52 57 65 50 70
Temp1: N1=8 21 32 36 41 47 52 57 65
Temp2: N2=2 50 70
Temp1: N1=8 21 32 36 41 47 52 57 65
Temp2: N2=2 50 70
M: 21 32 36 41 47 50 52 57 65 70
L = 16 > 10: Ket thuc thuat toan

+ Trong thuat giai nay chung ta luon thc hien log2(N) lan phan phoi va tron cac run.
Trang: 47
+ moi lan phan phoi run chung ta phai thc hien: N phep gan va 2N phep so sanh
(N phep so sanh het ng chay va N phep so sanh het day).
+ moi lan tron run chung ta cung phai thc hien: N phep gan va 2N+N/2 phep so
sanh (N phep so sanh het ng chay, N phep so sanh het day va N/2 phep so
sanh gia tr cac cap tng ng tren 2 day phu).
So phep gan: G = 2NLog2(N)
So phep so sanh: S = (4N+N/2)Log2(N)
+ Trong thuat giai nay chung ta s dung 02 day phu, tuy nhien tong so phan t 02
day phu nay cung ch bang N, do vay a tao ra s lang ph bo nh khong can
thiet. e giai quyet van e nay chung ta ch can s dung 01 day phu song chung
ta ket hp qua trnh tron cac cap run co chieu dai L tng ng hai au day
thanh cac run co chieu dai 2L va phan phoi luan phien ve hai au cua mot day
phu. Sau o chung ta oi vai tro cua 02 day nay cho nhau.
+ Trc khi hieu chnh lai thuat giai chung ta xet day M gom 10 phan t sau e minh
hoa cho qua trnh nay:
M: 81 63 69 74 14 77 56 57 9 25
Ta thc hien cac lan tron cac cap run hai au day nay va ket hp phan phoi cac
run mi tron ve hai au day kia nh sau:
Lan 1: L = 1
Tron cac cap run co chieu dai L = 1 tren M thanh cac run co chieu dai L = 2 va ket
hp phan phoi luan phien cac run nay ve hai au day Tmp:
M: 81 63 69 74 14 77 56 57 9 25
Tmp: 25 81 57 69 14 77 74 56 63 9
oi vai tro cua M va Tmp cho nhau
M: 25 81 57 69 14 77 74 56 63 9
Lan 2: L = 2
M: 25 81 57 69 14 77 74 56 63 9
Tmp: 9 25 63 81 14 77 74 69 57 56
Trang: 48
M: 9 25 63 81 14 77 74 69 57 56
Lan 3: L = 4
M: 9 25 63 81 14 77 74 69 57 56
Tmp: 9 25 56 57 63 69 74 81 77 14
M: 9 25 56 57 63 69 74 81 77 14
Lan 4: L = 8
M: 9 25 56 57 63 69 74 81 77 14
Tmp: 9 14 25 56 57 63 69 74 77 81
M: 9 14 25 56 57 63 69 74 77 81
L = 16 > 10: Ket thuc thuat toan

+ Nh vay, trong thuat giai nay chung ta ch con thao tac tron cac cap run co chieu
dai L tng ng hai au day thanh mot run mi co chieu dai 2L e a ve day
phu. Van e la chung ta se luan phien at run mi vao au day phu (theo th t
tang) va cuoi day phu (theo th t giam). Tc la hai bc tron va phan phoi a
c ket hp lai vi nhau. Thuat giai hieu chnh nh sau:
- Thuat toan Tron Phan phoi cac cap ng chay:
B1: I1 = 1 // Ch so t au day M
B2: I2 = N // Ch so t cuoi day M
B3: J1 = 1 // Ch so t au day Temp
B4: J2 = N // Ch so t cuoi day Temp
B5: Head = True // C bao pha at run mi trong qua trnh tron - phan phoi
B6: K1 = 1 // Ch so e duyet cac run au day M
B7: K2 = 1 // Ch so e duyet cac run cuoi day M
B8: IF (I1 > I2) // a tron va phan phoi het cac run
Trang: 49
Thc hien Bkt
B9: IF (M[I1] M[I2]) // M[I1] ng trc M[I2] tren Temp
B9.1: If (Head = True)
B9.1.1: Temp[J1] = M[I1]
B9.1.2: J1++
B9.2: Else
B9.2.1: Temp[J2] = M[I1]
B9.2.2: J2--
B9.3: I1++
B9.4: If (I1 > I2)
Thc hien Bkt
B9.5: K1++
B9.6: If (K1 > L) //a duyet het 1 run pha au trong M
Thc hien B11
B9.7: Lap lai B9
B10: ELSE // M[I2] ng trc M[I1] tren Temp
B10.1.1: Temp[J1] = M[I2]
B10.1.2: J1++
B10.2: Else
B10.2.1: Temp[J2] = M[I2]
B10.2.2: J2--
B10.3: I2--
B10.4: If (I1 > I2)
Thc hien Bkt
B10.5: K2++
B10.6: If (K2 > L) //a duyet het 1 run pha sau trong M
Thc hien B18
B10.7: Lap lai B9
//Chep phan run con lai pha sau trong M ve Temp
B11: IF (K2 > L) //a chep het phan run con lai pha sau trong M ve Temp
B11.1: Head = Not(Head)
B11.2: Lap lai B6
B12: IF (Head = True)
B12.1: Temp[J1] = M[I2]
B12.2: J1++
B13: ELSE
B13.1: Temp[J2] = M[I2]
B13.2: J2--
B14: I2--
B15: If (I1 > I2)
Thc hien Bkt
B16: K2++
B17: Lap lai B11
//Chep phan run con lai pha trc trong M ve Temp
B18: IF (K1 > L) //a chep het phan run con lai pha trc trong M ve Temp
Trang: 50
B18.2: Lap lai B6
B19.1: Temp[J1] = M[I1]
B19.2: J1++
B20: ELSE
B20.1: Temp[J2] = M[I1]
B20.2: J2--
B21: I1++
B22: If (I1 > I2)
Thc hien Bkt
B23: K1++
B24: Lap lai B18
Bkt: Ket thuc
- Thuat toan sap xep tron thang hieu chnh:
B2: IF (L N) //Day ch con 01 run
Thc hien Bkt
B3: Tron_Phan_Phoi(M, N, Temp, L)
B4: L = 2*L
B5: IF (L > N)
// Chep cac phan t t Temp ve M
B5.1: I = 1
B5.2: If (I > N)
Thc hien Bkt
B5.3: M[I] = Temp[I]
B5.4: I++
B5.5: Lap lai B5.2
B6: Tron_Phan_Phoi(Temp, N, M, L)
B7: L = 2*L
B8: Lap lai B2
Bkt: Ket thuc
- Cai at thuat toan hieu chnh:
Ham StraightMergeSortModify co prototype nh sau:
void StraightMergeSortModify(T M[], int N);
tang da tren thuat toan sap tron trc tiep a hieu chnh. Ham s dung ham
MergeDistribute co prototype va y ngha nh sau:
void MergeDistribute(T M[], int N, T Temp[], int L);
Ham thc hien viec tron cac cap run co chieu dai L hai au day M thanh mot run
co chieu dai 2L va phan phoi luan phien cac run co chieu dai 2L nay ve hai au day
Temp. Noi dung cua ham nh sau:
void MergeDistribute(T M[], int N, T Temp[], int L)
Trang: 51
{ int I1 = 0, I2 = N-1, J1 = 0, J2 = N-1, K1 = 0, K2 = 0, Head = 1;
while (I1 <= I2)
{ while (M[I1] <= M[I2] && I1 <= I2)
{ if (Head == 1)
{ Temp[J1] = M[I1];
J1++;
}
else
{ Temp[J2] = M[I1];
J2--;
}
I1++;
if (I1 > I2)
break;
K1++;
if (K1 == L)
{ for (; K2 < L && I1 <= I2; K2++, I2--)
if (Head == 1)
{ Temp[J1] = M[I2];
J1++;
}
else
{ Temp[J2] = M[I2];
J2--;
}
Head = 0-Head;
K1 = K2 = 0;
break;
}
}
while (M[I2] <= M[I1] && I1 <= I2)
{ if (Head == 1)
{ Temp[J1] = M[I2];
J1++;
}
else
{ Temp[J2] = M[I2];
J2--;
}
I2--;
if (I1 > I2)
break;
K2++;
if (K2 == L)
{ for (; K1 < L && I1<= I2; K1++, I1++)
if (Head == 1)
{ Temp[J1] = M[I1];
J1++;
Trang: 52
}
else
{ Temp[J2] = M[I1]
J2--;
}
Head = 0-Head;
K1 = K2 = 0;
break;
}
}
}
return;
}
//========================================================
void StraightMergeSortModify(T M[], int N)
{ int L = 1 ;
T * Temp = new T[N];
if (Temp == NULL)
return;
while (L < N)
{ MergeDistribute(M, N, Temp, L);
L = 2*L;
if (L >= N)
{ for (int I = 0; I < N; I++)
M[I] = Temp[I];
break;
}
MergeDistribute(Temp, N, M, L);
L = 2*L;
}
delete Temp;
return;
}
- Phan tch thuat toan hieu chnh:
+ Trong thuat giai nay chung ta luon thc hien log2(N) lan tron - phan phoi cac run.
+ Moi lan tron-phan phoi chung ta phai thc hien: N phep gan va N+N/2+N/2=2N
phep so sanh.
So phep gan: G = NLog2(N)
So phep so sanh: S = 2NLog2(N)
+ Nh vay thuat giai tron thang hieu chnh va tiet kiem bo nh, va thc hien nhanh
hn thuat giai tron thang ban au.
+ Tuy nhien, trong thuat giai tron thang chung ta a thc hien viec phan phoi va tron
cac cap ng chay co chieu dai co nh ma trong thc te tren day cac ng
Trang: 53
chay co the co chieu dai ln hn. ieu nay se giam bt so lan phan phoi va tron
cac cap ng chay cho chung ta. Thuat giai tron t nhien c trnh bay sau ay
se loai bo c nhc iem nay cua thuat giai tron thang.
b. Thuat toan sap xep tron t nhien (Natural Merge Sort):

- T tng:
Tan dung cac ng chay t nhien co san tren day, tien hanh tron tng ng cac
cap ng chay t nhien nam hai au day M thanh mot ng chay mi va phan
phoi luan phien cac ng chay mi nay ve hai au day phu Temp. Sau o lai tiep
tuc tron tng ng tng cap run hai au day phu Temp thanh mot run mi va phan
phoi luan phien run mi nay ve hai au day M. C tiep tuc nh vay cho en khi tren
M hoac tren Temp ch con lai 01 run th ket thuc.
- Thuat toan Tron Phan phoi cac cap ng chay t nhien:
B1: I1 = 1 // Ch so t au day M
B2: I2 = N // Ch so t cuoi day M
B3: J1 = 1 // Ch so t au day Temp
B4: J2 = N // Ch so t cuoi day Temp
B5: Head = True // C bao pha at run mi trong qua trnh tron - phan phoi
B6: IF (I1 > I2) // a tron va phan phoi het cac run
Thc hien Bkt
B7: IF (M[I1] M[I2]) // M[I1] ng trc M[I2] tren Temp
B7.1.1: Temp[J1] = M[I1]
B7.1.2: J1++
B7.2: Else
B7.2.1: Temp[J2] = M[I1]
B7.2.2: J2--
B7.3: I1++
B7.4: If (I1 > I2)
Thc hien Bkt
B7.5: If (M[I1] < M[I1-1]) //a duyet het 1 run pha au trong M
Thc hien B9
B7.6: Lap lai B7
B8: ELSE // M[I2] ng trc M[I1] tren Temp
B8.1.1: Temp[J1] = M[I2]
B8.1.2: J1++
B8.2: Else
B8.2.1: Temp[J2] = M[I2]
B8.2.2: J2--
B8.3: I2--
B8.4: If (I1 > I2)
Thc hien Bkt
Trang: 54
B8.5: If (M[I2] < M[I2+1]) //a duyet het 1 run pha sau trong M
Thc hien B15
B8.6: Lap lai B7
//Chep phan run con lai pha sau trong M ve Temp
B9: IF (M[I2] < M[I2+1]) //a chep het phan run con lai pha sau trong M ve Temp
B9.2: Lap lai B6
B10.1: Temp[J1] = M[I2]
B10.2: J1++
B11: ELSE
B11.1: Temp[J2] = M[I2]
B11.2: J2--
B12: I2--
B13: IF (I1> I2)
Thc hien Bkt
B14: Lap lai B9
//Chep phan run con lai pha trc trong M ve Temp
B15: IF (M[I1]< M[I1-1]) //a chep het phan run con lai pha trc trong M ve Temp
B15.2: Lap lai B6
B16.1: Temp[J1] = M[I1]
B16.2: J1++
B17: ELSE
B17.1: Temp[J2] = M[I1]
B17.2: J2--
B18: I1++
B19: IF (I1> I2)
Thc hien Bkt
B20: Lap lai B15
Bkt: Ket thuc
- Thuat toan sap xep tron t nhien:
B1: L = 1 //Khi tao chieu dai ban au cua run au tien
//Tm chieu dai ban au cua run au tien
B2: IF (N < 2)
B2.1: L=N
B2.2: Thc hien Bkt
B3: IF (M[L] M[L+1] And L < N)
B3.1: L++
B3.2: Lap lai B3
B4: IF (L = N) //Day ch con 01 run
Thc hien Bkt
B5: Tron_Phan_Phoi(M, N, Temp, L)
B6: IF (L = N)
Trang: 55
// Chep cac phan t t Temp ve M
B6.1: I = 1
B6.2: If (I > N)
Thc hien Bkt
B6.3: M[I] = Temp[I]
B6.4: I++
B6.5: Lap lai B6.2
B7: Tron_Phan_Phoi(Temp, N, M, L)
B8: Lap lai B4
Bkt: Ket thuc
- Cai at thuat toan tron t nhien:
Ham NaturalMergeSort co prototype nh sau:
void NaturalMergeSort(T M[], int N);
tang da tren thuat toan sap tron trc t nhien. Ham s dung ham
NaturalMergeDistribute co prototype va y ngha nh sau:
void NaturalMergeDistribute(T M[], int N, T Temp[], int &L);
Ham thc hien viec tron cac cap run hai au day M ma run au tien co chieu dai L
thanh mot run mi chieu dai ln hn hoac bang L va phan phoi luan phien run mi
nay ve hai au day Temp. Noi dung cua ham nh sau:
void NaturalMergeDistribute(T M[], int N, T Temp[], int &L)
{ int I1 = 0, I2 = N-1, J1 = 0, J2 = N-1, Head = 1, FirstPair = 1;
while (I1 < I2)
{ while (M[I1] <= M[I2] && I1 < I2)
{ if (Head == 1)
{ Temp[J1] = M[I1];
J1++;
}
else
{ Temp[J2] = M[I1];
J2--;
}
I1++;
if (M[I1] < M[I1-1])
{ while (M[I2] <= M[I2-1] && I2 > I1)
{ if (Head == 1)
{ Temp[J1] = M[I2];
J1++;
if (FirstPair == 1)
L++;
}
else
{ Temp[J2] = M[I2];
J2--;
}
Trang: 56
I2--;
}
if (Head == 1)
{ Temp[J1] = M[I2];
J1++;
If (FirstPair == 1)
L++;
}
else
{ Temp[J2] = M[I2];
J2--;
}
I2--;
FirstPair = 0;
if (I1 > I2)
return;
Head = 0 Head;
break;
}
}
if (I1 == I2)
{ Temp[J1] = M[I1];
if (I1 == N-1)
L = N;
return;
}
while (M[I2] <= M[I1] && I1 < I2)
{ if (Head == 1)
{ Temp[J1] = M[I2];
J1++;
if (FirstPair == 1)
L++;
}
else
{ Temp[J2] = M[I2];
J2--;
}
I2--;
if (M[I2] < M[I2+1])
{ while (M[I1] <= M[I1+1] && I1 < I2)
{ if (Head == 1)
{ Temp[J1] = M[I1];
J1++;
}
else
{ Temp[J2] = M[I1];
J2--;
}
Trang: 57
I1++;
}
if (Head == 1)
{ Temp[J1] = M[I1];
J1++;
}
else
{ Temp[J2] = M[I1];
J2--;
}
I1++;
FirstPair = 0;
if (I1 > I2)
return;
Head = 0 Head;
break;
}
}
if (I1 == I2)
{ Temp[J1] = M[I1];
if (I1 == N-1)
L = N;
return;
}
}
return;
}
//========================================================
void NaruralMergeSort1(T M[], int N)
{ int L = 1 ;
if (N < 2)
return;
while (M[L-1] < M[L] && L<N)
L++;
T * Temp = new T[N];
if (Temp == NULL)
return;
while (L < N)
{ NaturalMergeDistribute(M, N, Temp, L);
if (L == N)
{ for (int I = 0; I < N; I++)
M[I] = Temp[I];
break;
}
NaturalMergeDistribute(Temp, N, M, L);
}
delete Temp;
return;
Trang: 58
}
M: 51 39 45 55 20 15 20 17 40 10
Ta thc hien cac lan tron cac cap run t nhien hai au day nay va ket hp phan
phoi cac run mi tron ve hai au day kia nh sau:
Lan 1: L = 1
Tron cac cap run t nhien co chieu dai L1 = 1 va L2 = 2 tren M thanh cac run co
chieu dai L = 3 va ket hp phan phoi luan phien cac run nay ve hai au day Tmp:
M: 51 39 45 55 20 15 20 17 40 10
Tmp: 10 40 51 15 20 55 45 39 20 17
M: 10 40 51 15 20 55 45 39 20 17
Lan 2: L = 3
M: 10 40 51 15 20 55 45 39 20 17
Tmp: 10 17 20 39 40 45 51 55 20 15
M: 10 17 20 39 40 45 51 55 20 15
Lan 3: L = 8
M: 10 17 20 39 40 45 51 55 20 15
Tmp: 10 15 17 20 20 39 40 45 51 55
M: 10 15 17 20 20 39 40 45 51 55
Trang: 59
L = 10: Ket thuc thuat toan
- Phan tch thuat toan tron t nhien:
+ Trong trng hp tot nhat, khi day co th t tang th chung ta khong phai qua
bc phan phoi va tron nao het:
So phep so sanh: Smin = 2(N-1) + 2 = 2N
+ Trong trng hp xau nhat, khi day co th t giam na au va co th t tang
na cuoi va moi bc tron phan phoi th o dai ng chay mi cung ch tang
gap oi. Trong trng hp nay se giong nh thuat toan tron thang a hieu chnh:
So phep gan: Gmax = NLog2(N)+1
So phep so sanh: Smax = 2NLog2(N)+2
+ Trung bnh:
So phep gan: Gavg = NLog2(N)/2+1
So phep so sanh: Savg = NLog2(N) + N + 1
Lu y:
+ Trong thuat toan nay chung ta cung co the s dung 2 day phu Temp1, Temp2 nh
trong thuat toan tron trc tiep, khi o chung ta luon luon duyet t au en cuoi
cac day ch khong can thiet phai duyet t hai au day vao gia. Tuy nhien, trong
trng nay th bo nh trung gian se ton nhieu hn.
+ Trong cac thuat toan sap xep theo phng phap tron, viec s dung nhieu day phu
co the lam giam bt so lan phan phoi va tron cac run. Tuy nhien, viec quan ly cac
day phu se phc tap hn.
3.3. Cac giai thuat sap xep ngoai (Sap xep tren tap tin)
ay, do so phan t d lieu thng ln nen mot phan d lieu can sap xep c a
vao trong bo nh trong (RAM), phan con lai c lu tr bo nh ngoai (DISK). Do
vay, toc o sap xep d lieu tren tap tin tng oi cham. Cac giai thuat sap xep ngoai
bao gom cac nhom sau:
- Sap xep bang phng phap tron (merge sort),
- Sap xep theo ch muc (index sort).
Nh vay trong phan nay chung ta tm cach sap xep tap tin F co N phan t d lieu co
kieu T (khoa nhan dien cac phan t d lieu co kieu T) theo th t tang.
3.3.1. Sap xep bang phng phap tron (Merge Sort)

Tng t nh oi vi sap xep theo phng phap tron tren mang, trong cac thuat giai
ay chung ta se tm cach phan phoi cac ng chay trong tap tin d lieu ve cac tap tin
trung gian va sau o lai tron tng ng cac cap ng chay tren cac tap tin trung gian
thanh mot ng chay mi co chieu dai ln hn.
Trang: 60
Cac thuat toan sap xep bang phng phap tron tren tap tin bao gom:
- Thuat toan sap xep tron thang hay tron trc tiep (straight merge sort),
- Thuat toan sap xep tron t nhien (natural merge sort),
- Thuat toan tron a loi can bang (multiways merge sort),
- Thuat toan tron a pha (multiphases merge sort).
ay chung ta ch nghien cu hai thuat toan tron au tien.
a. Thuat toan sap xep tron trc tiep (Straight Merge Sort):
- T tng:
Tng t nh thuat toan tron trc tiep tren mang, ban au tap tin Fd co N run(s) vi
chieu dai moi run: L = 1, ta tien hanh phan phoi luan phien N run(s) cua tap tin Fd
ve K tap tin phu Ft1, Ft2, , FtK (Moi tap tin phu co N/K run(s)). Sau o tron tng
ng tng bo K run(s) K tap tin phu Ft1, Ft2, , FtK thanh mot run mi co chieu
dai L = K e a ve tap tin Fd va tap tin Fd tr thanh tap tin co N/K run(s) vi chieu
dai moi run: L = K.
Nh vay, sau moi lan phan phoi va tron cac run tren tap tin Fd th so run tren tap tin
Fd se giam i K lan, ong thi chieu dai moi run tren Fd se tang len K lan. Do o,
sau LogK(N) lan phan phoi va tron th tap tin Fd ch con lai 01 run vi chieu dai la N
va khi o tap tin Fd tr thanh tap tin co th t.
Trong thuat giai nay, e de theo doi chung ta s dung 2 tap tin phu (K = 2) va qua
trnh phan phoi, tron cac run c trnh bay rieng thanh 2 thuat giai:
+ Thuat giai phan phoi luan phien (tach) cac ng chay vi chieu dai L tren tap
tin Fd ve hai tap tin phu Ft1, Ft2;
+ Thuat giai tron (nhap) cac cap ng chay tren hai tap tin Ft1, Ft2 co chieu dai
L ve tap tin Fd thanh cac ng chay vi chieu dai 2*L;
Gia s rang cac loi thao tac tren tap tin se b bo qua trong qua trnh thc hien.
B1: Fd = fopen(DataFile, r) //M tap tin d lieu can sap xep e oc d lieu
B2: Ft1 = fopen(DataTemp1, w) //M tap tin trung gian th nhat e ghi d lieu
B3: Ft2 = fopen(DataTemp2, w) //M tap tin trung gian th hai e ghi d lieu
B4: IF (feof(Fd)) //a phan phoi het
Thc hien Bkt
//Chep 1 run t Fd sang Ft1
B5: K = 1 //Ch so em e duyet cac run
B6: IF (K > L) //Duyet het 1 run
Thc hien B12
B7: fread(&a, sizeof(T), 1, Fd) //oc 1 phan t cua run tren Fd ra bien tam a
B8: fwrite(&a, sizeof(T), 1, Ft1) //Ghi gia tr bien tam a vao tap tin Ft1
B9: K++
Thc hien Bkt
B11: Lap lai B6
//Chep 1 run t Fd sang Ft2
B12: K = 1
Trang: 61
B13: IF (K > L)
Thc hien B19
B16: K++
Thc hien Bkt
B18: Lap lai B13
B19: Lap lai B4
Bkt: Ket thuc
- Thuat toan tron:
B1: Ft1 = fopen(DataTemp1, r) //M tap tin trung gian th nhat e oc d lieu
B2: Ft2 = fopen(DataTemp2, r) //M tap tin trung gian th hai e oc d lieu
B3: Fd = fopen(DataFile, w) //M tap tin d lieu e ghi d lieu
B4: fread(&a1, sizeof(T), 1, Ft1) //oc 1 phan t cua run tren Ft1 ra bien tam a1
B6: K1 = 1 //Ch so e duyet cac run tren Ft1
B7: K2 = 1 //Ch so e duyet cac run tren Ft2
B8: IF (a1 a2) // a1 ng trc a2 tren Fd
B8.1: fwrite(&a1, sizeof(T), 1, Fd)
B8.2: K1++
B8.3: If (feof(Ft1)) //a chep het cac phan t trong Ft1
Thc hien B23
B8.4: fread(&a1, sizeof(T), 1, Ft1)
B8.5: If (K1 > L) //a duyet het 1 run trong Ft1
Thc hien B11
B8.6: Lap lai B8
B9: ELSE // a2 ng trc a1 tren Fd
B9.2: K2++
Thc hien B27
B9.4: fread(&a2, sizeof(T), 1, Ft2)
B9.5: If (K2 > L) //a duyet het 1 run trong Ft2
Thc hien B17
B9.6: Lap lai B8
B10: Lap lai B6
//Chep phan run con lai trong Ft2 ve Fd
B11: IF (K2 > L) //a chep het phan run con lai trong Ft2 ve Fd
Lap lai B6
B12: fwrite(&a2, sizeof(T), 1, Fd)
B13: K2++
B14: IF (feof(Ft2)) //a chep het cac phan t trong Ft2
Thc hien B27
B15: fread(&a2, sizeof(T), 1, Ft2)
B16: Lap lai B11
Trang: 62
//Chep phan run con lai trong Ft1 ve Fd
B17: IF (K1 > L) //a chep het phan run con lai trong Ft1 ve Fd
Lap lai B6
B19: K1++
B20: IF (feof(Ft1)) //a chep het cac phan t trong Ft1
Thc hien B23
B22: Lap lai B17
//Chep cac phan t con lai trong Ft2 ve Fd
B24: IF (feof(Ft2))
Thc hien Bkt
B26: Lap lai B23
B28: IF (feof(Ft1))
Thc hien Bkt
B30: Lap lai B27
Bkt: Ket thuc
- Thuat toan sap xep tron thang:
B2: IF (L N) //Tap tin Fd ch con 01 run
Thc hien Bkt
B3: Phan_Phoi(DataFile, DataTemp1, DataTemp2, L)
B4: Tron(DataTemp1, DataTemp2, DataFile, L)
B5: L = 2*L
B6: Lap lai B2
Bkt: Ket thuc
Ham FileStraightMergeSort co prototype nh sau:
int FileStraightMergeSort(char * DataFile);
Ham thc hien viec sap xep cac phan t co kieu d lieu T tren tap tin co ten
DataFile theo th t tang da tren thuat toan sap tron trc tiep. Neu viec sap xep
thanh cong ham tra ve gia tr 1, trong trng hp ngc lai (do co loi khi thc hien
cac thao tac tren tap tin) ham tra ve gia tr 1. Ham s dung cac ham FileDistribute,
FileMerge co prototype va y ngha nh sau:
int FileDistribute(char * DataFile, char * DataTemp1, char * DataTemp2, int L);
Ham thc hien viec phan phoi luan phien cac ng chay co chieu dai L tren tap tin
d lieu co ten DataFile ve cho cac tap tin tam thi co ten tng ng la DataTemp1
Trang: 63
va DataTemp2. Ham tra ve gia tr 1 neu viec phan phoi hoan tat, trong trng hp
ngc lai ham tra ve gia tr 1.
int FileMerge(char * DataTemp1, char * DataTemp2, char * DataFile, int L);
Ham thc hien viec tron tng cap tng ng cac ng chay vi o dai L tren hai
tap tin tam thi co ten DataTemp1, DataTemp2 ve tap tin d lieu ban au co ten
DataFile thanh cac ng chay co chieu dai 2*L. Ham tra ve gia tr 1 neu viec tron
hoan tat, trong trng hp ngc lai ham tra ve gia tr 1.
Ca hai ham nay eu s dung cac ham Finished e lam nhiem vu don dep (ong
cac tap tin a m, huy vung nh a cap phat, ) va tra ve mot gia tr nguyen e ket
thuc. Cac ham Finished co prototype nh sau:
int Finished (FILE * F1, int ReturnValue);
int Finished (FILE * F1, FILE * F2, int ReturnValue);
int Finished (FILE * F1, FILE * F2, FILE * F3, int ReturnValue);
int Finished (FILE * F1, int ReturnValue)
{ fclose (F1);
return (ReturnValue);
}
//========================================================
int Finished (FILE * F1, FILE * F2, int ReturnValue)
{ fclose (F1);
fclose (F2);
}
//========================================================
int Finished (FILE * F1, FILE * F2, FILE * F3, int ReturnValue);
{ fclose (F1);
fclose (F2);
fclose (F3);
}
//========================================================
int FileDistribute(char * DataFile, char * DataTemp1, char * DataTemp2, int L)
{ FILE * Fd = fopen(DataFile, rb);
if (Fd == NULL)
return (-1);
FILE * Ft1 = fopen(DataTemp1, wb);
if (Ft1 == NULL)
return(Finished(Fd, -1));
if (Ft2 == NULL)
return(Finished(Fd, Ft1, -1));
T a;
Trang: 64
while (!feof(Fd))
{ for(int K = 0; K<L && !feof(Fd); K++)
{ int t = fread(&a, SOT, 1, Fd);
if (t < 1)
{ if (feof(Fd))
break;
return (Finished(Fd, Ft1, Ft2, -1));
}
t = fwrite(&a, SOT, 1, Ft1);
if (t < 1)
return(Finished(Fd, Ft1, Ft2, -1));
}
for(K = 0; K<L && !feof(Fd); K++)
{ int t = fread(&a, SOT, 1, Fd);
if (t < 1)
{ if (feof(Fd))
break;
}
t = fwrite(&a, SOT, 1, Ft2);
if (t < 1)
}
}
return (Finished(Fd, Ft1, Ft2, 1));
}
//========================================================
int FileMerge(char * DataTemp1, char * DataTemp2, char * DataFile, int L)
{ FILE * Ft1 = fopen(DataTemp1, rb);
if (Ft1 == NULL)
return (-1);
FILE * Ft2 = fopen(DataTemp2, rb);
if (Ft2 == NULL)
return (Finished(Ft1, -1);
FILE * Fd = fopen(DataFile, wb);
if (Fd == NULL)
return (Finished(Ft1, Ft2, -1);
int K1 = 0, K2 = 0;
T a1, a2;
if (fread(&a1, SOT, 1, Ft1) < 1)
while (!feof(Ft1) && !feof(Ft2))
{ if (a1 <= a2)
Trang: 65
{ int t = fwrite(&a1, SOT, 1, Fd);
if (t < 1)
K1++;
t = fread(&a1, SOT, 1, Ft1);
if (t < 1)
{ if (feof(Ft1))
break;
return (Finished (Fd, Ft1, Ft2, -1));
}
if (K1 == L)
{ for (; K2 < L && !feof(Ft2); K2++)
{ t = fwrite(&a2, SOT, 1, Fd);
if (t < 1)
if (t < 1)
{ if (feof(Ft2))
break;
}
}
if (feof(Ft2))
break;
}
if (K1 == L && K2 == L)
K1 = K2 = 0;
}
else
if (t < 1)
K2++;
if (t < 1)
{ if (feof(Ft1))
break;
}
if (K2 == L)
{ for (; K1 < L && !feof(Ft1); K1++)
{ t = fwrite(&a1, SOT, 1, Fd);
if (t < 1)
if (t < 1)
{ if (feof(Ft1))
break;
Trang: 66
}
}
if (feof(Ft1))
break;
}
if (K1 == L && K2 == L)
K1 = K2 = 0;
}
}
while (!feof(Ft1))
if (t < 1)
if (t < 1)
{ if (feof(Ft1))
break;
}
}
while (!feof(Ft2))
if (t < 1)
if (t < 1)
{ if (feof(Ft2))
break;
}
}
}
//========================================================
int FileStraightMergeSort(char * DataFile)
{ int Fhd = open(DataFile, O_RDONLY);
if (Fhd < 0)
return (-1);
int N = filelength(Fhd)/sizeof(T);
close(Fhd);
if (N < 2)
return (1);
int L = 1;
char * Temp1 = Data1.Tmp;
while (L < N)
{ if (FileDistribute(DataFile, Temp1, Temp2, L) == -1)
Trang: 67
{ remove(Temp1);
remove(Temp2);
return (-1);
}
if (FileMerge(Temp1, Temp2, DataFile, L) == -1)
{ remove(Temp1);
remove(Temp2);
return (-1);
}
L = 2*L;
}
remove (Temp1);
remove (Temp2);
return (1);
}
- V du minh hoa thuat toan sap xep tron thang:
Gia s d lieu ban au tren tap tin Fd nh sau:
10 4 15 2 1 20 22 15 14 30 5 8 40 31 36
Ta tien hanh phan phoi va tron cac ng chay co chieu dai co nh L:
Lan 1: L = 1
Phan phoi luan phien cac ng chay chieu dai L = 1 tren Fd ve Ft1 va Ft2:
Fd: 10 4 15 2 1 20 22 15 14 30 5 8 40 31 36
Ft1: 10 15 1 22 14 5 40 36
Ft2: 4 2 20 15 30 8 31
Tron cac cap ng chay tng ng chieu dai L = 1 tren Ft1 va Ft2 thanh cac ng
chay chieu dai L = 2 (thc te L co the nho hn 2) va a ve Fd:
Ft1: 10 15 1 22 14 5 40 36
Ft2: 4 2 20 15 30 8 31
Fd: 4 10 2 15 1 20 15 22 14 30 5 8 31 40 36
Lan 2: L = 2
Phan phoi luan phien cac ng chay chieu dai L 2 tren Fd ve Ft1 va Ft2:
Fd: 4 10 2 15 1 20 15 22 14 30 5 8 31 40 36
Ft1: 4 10 1 20 14 30 31 40
Ft2: 2 15 15 22 5 8 36
Tron cac cap ng chay tng ng chieu dai L 2 tren Ft1 va Ft2 thanh cac ng
chay chieu dai L 4 va a ve Fd:
Ft1: 4 10 1 20 14 30 31 40
Ft2: 2 15 15 22 5 8 36
Fd: 2 4 10 15 1 15 20 22 5 8 14 30 31 36 40
Trang: 68
Lan 3: L = 4
Fd: 2 4 10 15 1 15 20 22 5 8 14 30 31 36 40
Ft1: 2 4 10 15 5 8 14 30
Ft2: 1 15 20 22 31 36 40
chay chieu dai L 8 va a ve Fd:
Ft1: 2 4 10 15 5 8 14 30
Ft2: 1 15 20 22 31 36 40
Fd: 1 2 4 10 15 15 20 22 5 8 14 30 31 36 40
Lan 4: L = 8
Fd: 1 2 4 10 15 15 20 22 5 8 14 30 31 36 40
Ft1: 1 2 4 10 15 15 20 22
Ft2: 5 8 14 30 31 36 40
chay chieu dai L 16 va a ve Fd. Thuat toan ket thuc:
Ft1: 1 2 4 10 15 15 20 22
Ft2: 5 8 14 30 31 36 40
Ft1: 1 2 4 5 8 10 14 15 15 20 22 30 31 36 40
+ Trong thuat giai nay chung ta luon thc hien log2(N) lan phan phoi va tron cac run.
+ moi lan phan phoi run chung ta phai thc hien: N lan oc va ghi a, 2N phep so
sanh (N lan so sanh het run va N lan so sanh het tap tin).
+ moi lan tron run chung ta cung phai thc hien: N lan oc va ghi a, 2N+N/2
phep so sanh (N lan so sanh het run, N lan so sanh het tap tin va N/2 lan so sanh
cac cap gia tr tng ng tren 2 tap tin phu).
So lan oc va ghi a: D = 2NLog2(N)
So phep so sanh: S = (4N + N/2)Log2(N)
+ Trong thuat toan nay chung ta s dung 2 tap tin phu e thc hien viec phan phoi
va tron cac ng chay. Khi so tap tin phu t 3 tap tin tr len (K>2) th cac thuat
toan tron c goi la tron a loi (multiways) va se lam giam so lan phan phoi tron
cac ng chay, tc la lam giam so lan oc va ghi a.
+ Can lu y la thi gian thc hien cac thuat giai sap xep/tm kiem tren tap tin phu
thuoc rat nhieu vao cac thao tac oc va ghi a.
Trang: 69
b. Thuat toan sap xep tron t nhien (Natural Merge Sort):
- T tng:
Tng t nh thuat toan tron t nhien tren mang, chung ta tan dung cac ng chay
t nhien ban au tren tap tin Fd co chieu dai khong co nh. Tien hanh phan phoi
luan phien cac ng chay t nhien nay cua tap tin Fd ve 2 tap tin phu Ft1, Ft2. Sau
o tron tng ng tng cap ng chay t nhien 2 tap tin phu Ft1, Ft2 thanh mot
ng chay mi co chieu dai bang tong chieu dai cua cap hai ng chay em tron
va a ve tap tin Fd.
Nh vay, sau moi lan phan phoi va tron cac ng chay t nhien tren tap tin Fd th
so ng chay t nhien tren tap tin Fd se giam i mot na, ong thi chieu dai cac
ng chay t nhien cung c tang len. Do o, sau toi a Log2(N) lan phan phoi va
tron th tap tin Fd ch con lai 01 ng chay vi chieu dai la N va khi o tap tin Fd
tr thanh tap tin co th t.
Trong thuat giai nay chung ta s dung 2 tap tin phu (co the s dung nhieu hn) va
qua trnh phan phoi, tron cac ng chay t nhien c trnh bay rieng biet thanh 2
thuat giai:
+ Thuat giai phan phoi luan phien (tach) cac ng chay t nhien tren tap tin Fd
ve hai tap tin phu Ft1, Ft2;
+ Thuat giai tron (nhap) cac cap ng chay t nhien tren hai tap tin Ft1, Ft2 ve
tap tin Fd thanh cac ng chay t nhien vi chieu dai ln hn;
va chung ta cung gia s rang cac loi thao tac tren tap tin se b bo qua.
B1: Fd = fopen(DataFile, r) //M tap tin d lieu can sap xep e oc d lieu
B2: Ft1 = fopen(DataTemp1, w) //M tap tin trung gian th nhat e ghi d lieu
B3: Ft2 = fopen(DataTemp2, w) //M tap tin trung gian th hai e ghi d lieu
Thc hien Bkt
//Chep 1 ng chay t nhien t Fd sang Ft1
Thc hien Bkt
B8: fread(&b, sizeof(T), 1, Fd) //oc tiep 1 phan t cua run tren Fd ra bien tam b
B9: IF (a > b) // a duyet het 1 ng chay t nhien
B9.1: a = b // Chuyen vai tro cua b cho a
B9.2: Thc hien B12
B10: a = b
B11: Lap lai B6
//Chep 1 ng chay t nhien t Fd sang Ft2
Thc hien Bkt
Trang: 70
B14: fread(&b, sizeof(T), 1, Fd) //oc 1 phan t cua run tren Fd ra bien tam b
B15: IF (a > b) // a duyet het 1 ng chay t nhien
B15.1: a = b // Chuyen vai tro cua b cho a
B15.2: Thc hien B18
B16: a = b
B17: Lap lai B12
B18: Lap lai B6
Bkt: Ket thuc
- Thuat toan tron:
B1: Ft1 = fopen(DataTemp1, r) //M tap tin trung gian th nhat e oc d lieu
B2: Ft2 = fopen(DataTemp2, r) //M tap tin trung gian th hai e oc d lieu
B3: Fd = fopen(DataFile, w) //M tap tin d lieu e ghi d lieu
B6: IF (a1 a2) // a1 ng trc a2 tren Fd
Thc hien B21 //Chep cac phan t con lai trong Ft2 ve Fd
B6.3: fread(&b1, sizeof(T), 1, Ft1) //oc tiep 1 phan t tren Ft1 ra bien tam b1
B6.4: If (a1 > b1) //a duyet het ng chay t nhien trong Ft1
B6.4.1: a1 = b1 // Chuyen vai tro cua b1 cho a1
B6.4.2: Thc hien B9
B6.5: a1 = b1
B6.6: Lap lai B6
B7: ELSE // a2 ng trc a1 tren Fd
B7.2: If (feof(Ft2)) // a chep het cac phan t trong Ft2
Thc hien B25 // Chep cac phan t con lai trong Ft1 ve Fd
B7.3: fread(&b2, sizeof(T), 1, Ft2) //oc tiep 1 phan t tren Ft2 ra bien tam b2
B7.4: If (a2 > b2) // a duyet het ng chay t nhien trong Ft2
B7.4.1: a2 = b2 // Chuyen vai tro cua b2 cho a2
B7.4.2: Thc hien B15
B7.5: a2 = b2
B7.6: Lap lai B7
B8: Lap lai B6
//Chep phan ng chay t nhien con lai trong Ft2 ve Fd
B10: IF (feof(Ft2)) // a chep het cac phan t trong Ft2
B11: fread(&b2, sizeof(T), 1, Ft2)
B12: IF (a2 > b2) // a chep het 1 ng chay t nhien trong Ft2
B12.1: a2 = b2
B12.2: Lap lai B6
B13: a2 = b2
B14: Lap lai B9
Trang: 71
//Chep phan ng chay t nhien con lai trong Ft1 ve Fd
B16: IF (feof(Ft1)) // a chep het cac phan t trong Ft1
B17: fread(&b1, sizeof(T), 1, Ft1)
B18: IF (a1 > b1) // a chep het 1 ng chay t nhien trong Ft1
B18.1: a1 = b1
B18.2: Lap lai B6
B19: a1 = b1
B20: Lap lai B15
B22: IF (feof(Ft2))
Thc hien Bkt
B24: Lap lai B21
B26: IF (feof(Ft1))
Thc hien Bkt
B28: Lap lai B25
Bkt: Ket thuc
B1: L = Phan_Phoi(DataFile, DataTemp1, DataTemp2)
Thc hien Bkt
B3: L = Tron(DataTemp1, DataTemp2, DataFile)
Thc hien Bkt
B5: Lap lai B1
Bkt: Ket thuc
Ham FileNaturalMergeSort co prototype nh sau:
int FileNaturalMergeSort(char * DataFile);
Ham thc hien viec sap xep cac phan t co kieu d lieu T tren tap tin co ten
DataFile theo th t tang da tren thuat toan sap tron t nhien. Neu viec sap xep
thanh cong ham tra ve gia tr 1, trong trng hp ngc lai (do co loi khi thc hien
cac thao tac tren tap tin) ham tra ve gia tr 1. Ham s dung cac ham
FileNaturalDistribute, FileNaturalMerge co prototype va y ngha nh sau:
int FileNaturalDistribute(char * DataFile, char * DataTemp1, char * DataTemp2);
Ham thc hien viec phan phoi luan phien cac ng chay t nhien tren tap tin d
lieu co ten DataFile ve cho cac tap tin tam thi co ten tng ng la DataTemp1 va
Trang: 72
DataTemp2. Ham tra ve gia tr la chieu dai cua ng chay t nhien au tien trong
tap tin d lieu DataFile neu viec phan phoi hoan tat, trong trng hp ngc lai ham
tra ve gia tr 1.
int FileNaturalMerge(char * DataTemp1, char * DataTemp2, char * DataFile);
Ham thc hien viec tron tng cap tng ng cac ng chay t nhien tren hai tap tin
tam thi co ten DataTemp1, DataTemp2 ve tap tin d lieu ban au co ten DataFile
thanh cac ng chay co chieu bang tong chieu dai 2 ng chay em tron. Ham
tra ve chieu dai cua ng chay t nhien au tien sau khi tron tren tap tin DataFile
neu viec tron hoan tat, trong trng hp ngc lai ham tra ve gia tr 1.
int FileNaturalDistribute(char * DataFile, char * DataTemp1, char * DataTemp2)
{ FILE * Fd = fopen(DataFile, rb);
if (Fd == NULL)
return (-1);
if (Ft1 == NULL)
return (Finished (Fd, -1));
if (Ft2 == NULL)
return (Finished (Fd, Ft1, -1));
T a, b;
int L = 0, FirstRun1 = 1;
if (fread(&a, SOT, 1, Fd) < 1)
{ if (feof(Fd))
}
while (!feof(Fd))
{ do { int t = fwrite(&a, SOT, 1, Ft1);
if (t < 1)
if (FirstRun1 == 1)
L++;
t = fread(&b, SOT, 1, Fd);
if (t < 1)
{ if (feof(Fd))
break;
}
if (a > b)
{ a = b;
break;
}
a = b;
}
Trang: 73
while (1);
if (feof(Fd))
break;
do { int t = fwrite(&a, SOT, 1, Ft2);
if (t < 1)
t = fread(&b, SOT, 1, Fd);
if (t < 1)
{ if (feof(Fd))
break;
}
if (a > b)
{ a = b;
FirstRun1 = 0;
break;
}
a = b;
}
while (1);
}
return (Finished (Fd, Ft1, Ft2, L);
}
//========================================================
int FileNaturalMerge(char * DataTemp1, char * DataTemp2, char * DataFile)

{ FILE * Fd = fopen(DataFile, "wb");
if(Fd == NULL)
return(-1);
FILE * Ft1 = fopen(DataTemp1, "rb");
if(Ft1 == NULL)
return(Finished(Fd, -1));
FILE * Ft2 = fopen(DataTemp2, "rb");
if(Ft2 == NULL)
return(Finished(Fd, Ft1, -1));
int a1, a2, b1, b2;
int L = 0;
int FirstRun1 = 1, FirstRun2 = 1;
while(!feof(Ft1) && !feof(Ft2))
{ if (a1 <= a2)
if (t < 1)
if (FirsRun1 == 1)
Trang: 74
L++;
t = fread(&b1, SOT, 1, Ft1);
if (t < 1)
{ if (feof(Ft1))
break;
}
if (a1 > b1)
{ do { t = fwrite(&a2, SOT, 1, Fd);
if (t < 1)
if (FirstRun2 == 1)
L++;
if (t < 1)
{ if (feof(Ft2))
{ FirstRun2 = 0;
break;
}
}
if (a2 > b2)
{ FirstRun2 = 0;
a2 = b2;
break;
}
}
while(1);
a1 = b1;
FirstRun1 = 0;
if (feof(Ft2))
break;
}
a1 = b1;
}
else
if (t < 1)
if (FirstRun2 == 1)
L++;
if (t < 1)
{ if (feof(Ft2))
break;
}
if (a2 > b2)
Trang: 75
{ do { t = fwrite(&a1, SOT, 1, Fd);
if (t < 1)
if (Fr1 == 1)
L++;
if (t < 1)
{ if (feof(Ft1))
{ FirstRun1 = 0;
break;
}
}
if (a1 > b1)
{ FirstRun1 = 0;
a1 = b1;
break;
}
}
while(1);
a2 = b2;
FirstRun2 = 0;
if (feof(Ft1))
break;
}
a2 = b2;
}
}
while(!feof(Ft1))
if (t < 1)
if (FirstRun1 == 1)
L++;
if (t < 1)
{ if (feof(Ft1))
break;
}
}
while(!feof(Ft2))
if (t < 1)
if (FirstRun2 == 1)
L++;
Trang: 76
if (t < 1)
{ if (feof(Ft2))
break;
}
}
return(Finished(Fd, Ft1, Ft2, L));
}
//========================================================
int FileNaturalMergeSort(char * DataFile)
{ int Fhd = open(DataFile, O_RDONLY);
if (Fhd < 0)
return (-1);
int N = filelength(Fhd)/sizeof(T);
close (Fhd);
if (N < 2)
return (1);
int L = 0;
do{ L = FileNaturalDistribute(DataFile, Temp1, Temp2);
if (L == -1)
{ remove(Temp1);
remove(Temp2);
return (-1);
}
if (L == N)
break;
L = FileNaturalMerge(Temp1, Temp2, DataFile);
if (L == -1)
{ remove(Temp1);
remove(Temp2);
return (-1);
}
if (L == N)
break;
}
while (L < N);
remove(Temp1);
remove(Temp2);
return (1);
}
- V du minh hoa thuat toan sap xep tron t nhien:
Gia s d lieu ban au tren tap tin Fd nh sau:
80 24 5 12 11 2 2 15 10 35 35 18 4 1 6
Ta tien hanh phan phoi va tron cac ng chay t nhien:
Trang: 77
Lan 1: L = 1
Phan phoi luan phien cac ng chay t nhien tren Fd ve Ft1 va Ft2:
Fd: 80 24 5 12 11 2 2 15 10 35 35 18 4 1 6
Ft1: 80 5 12 2 2 15 18 1 6
Ft2: 24 11 10 35 35 4
Tron cac cap ng chay t nhien tng ng tren Ft1 va Ft2 thanh cac ng chay
t nhien trong o ng chay t nhien au tien co chieu dai L = 2 va a ve Fd:
Ft1: 80 5 12 2 2 15 18 1 6
Ft2: 24 11 10 35 35 4
Fd: 24 80 5 11 12 2 2 10 15 18 35 35 1 4 6
Lan 2: L = 2
Fd: 24 80 5 11 12 2 2 10 15 18 35 35 1 4 6
Ft1: 24 80 2 2 10 15 18 35 35
Ft2: 5 11 12 1 4 6
t nhien trong o ng chay t nhien au tien co chieu dai L = 5 va a ve Fd:
Ft1: 24 80 2 2 10 15 18 35 35
Ft2: 5 11 12 1 4 6
Fd: 5 11 12 24 80 1 2 2 4 6 10 15 18 35 35
Lan 3: L = 5
Fd: 5 11 12 24 80 1 2 2 4 6 10 15 18 35 35
Ft1: 5 11 12 24 80
Ft2: 1 2 2 4 6 10 15 18 35 35
t nhien trong o ng chay t nhien au tien co chieu dai L = 15 va a ve Fd.
Thuat toan ket thuc:
Ft1: 5 11 12 24 80
Ft2: 1 2 2 4 6 10 15 18 35 35
Fd: 1 2 2 4 5 6 10 11 12 15 18 24 35 35 80
+ Trong trng hp tot nhat, khi day co th t tang th sau khi phan phoi lan th
nhat thuat toan ket thuc, do o:
So lan oc ghi a: Dmin = N
Trang: 78
So phep so sanh: Smin = 2N
+ Trong trng hp xau nhat, khi day co th t giam va moi bc tron phan phoi
th o dai ng chay mi cung ch tang gap oi. Trong trng hp nay se giong
nh thuat toan tron trc tiep:
So lan oc va ghi a: Dmax = 2NLog2(N)
So phep so sanh: Smax = (4N + N/2)Log2(N)
+ Trung bnh:
So lan oc va ghi a: Davg = NLog2(N) + N/2
So phep so sanh: Savg = (2N + N/4)Log2(N) + N
3.3.2. Sap xep theo ch muc (Index Sort)
Thong thng kch thc cua cac phan t d lieu tren tap tin d lieu kha ln va kch
thc cua tap tin d lieu cung ln. Va lai bien ong d lieu tren tap tin d lieu t lien tuc
ma chu yeu la chung ta truy xuat d lieu thng xuyen. Do vay, viec oc ghi nhieu
len tap tin d lieu se lam cho thi gian truy xuat tap tin d lieu rat mat nhieu thi gian
va khong bao am an toan cho d lieu. e giai quyet van e nay chung ta tien hanh
thao tac tap tin d lieu thong qua mot tap tin tuan t ch muc theo khoa nhan dien cua
cac phan t d lieu.
a. T tng:
T tap tin d lieu ban au, chung ta tien hanh tao tap tin ch muc theo khoa nhan
dien cua cac phan t d lieu (Tap tin ch muc c sap xep tang theo khoa nhan
dien cua cac phan t d lieu). Tren c s truy xuat lan lt cac phan t trong tap tin
ch muc chung ta se ieu khien trat t xuat hien cua cac phan t d lieu trong tap tin
d lieu theo ung trat t tren tap tin ch muc. Nh vay trong thc tien, tap tin d lieu
khong b thay oi th t vat ly ban au tren a ma ch b thay oi trat t xuat hien
cac phan t d lieu khi c liet ke ra man hnh, may in, .
Ve cau truc cac phan t trong tap tin ch muc th nh a trnh bay trong phan tm
kiem theo ch muc (Chng 2). ay chung ta ch trnh bay cach tao tap tin ch
muc theo khoa nhan dien t tap tin d lieu ban au va cach thc ma tap tin ch muc
se ieu khien th t xuat hien cua cac phan t d lieu tren tap tin d lieu. Hai thao
tac nay se c trnh bay rieng thanh hai thuat toan:
- Thuat toan tao tap tin ch muc
- Thuat toan ieu khien th t xuat hien cac phan t d lieu da tren tap tin ch muc.
b. Thuat toan:
- Thuat toan tao tap tin ch muc
B1: Fd = open(DataFile, r) //M tap tin d lieu e oc d lieu
B2: Fidx = open(IdxFile, w) // M e tao mi tap tin ch muc
B3: CurPos = 0
B4: read (Fd, a)
B5: IF (EOF(Fd))
Thc hien B11
B6: ai.Key = a.Key
Trang: 79
B7: ai.Pos = CurPos
B8: write (Fidx, ai)
B9: CurPos += SOT
B10: Lap lai B4
B11: close (Fd)
B12: close (Fidx)
B13: FileNaturalMergeSort(IdxFile)
Bkt: Ket thuc
- Thuat toan ieu khien th t xuat hien cac phan t d lieu da tren tap tin ch muc
B1: Fd = open(DataFile, r) //M tap tin d lieu e oc d lieu
B2: Fidx = open(IdxFile, r) // M tap tin ch muc e oc
B3: read (Fidx, ai)
B4: IF (EOF(Fidx))
Thc hien B9
B5: seek(Fd, ai.Pos)
B6: read (Fd, a)
B7: Output (a) //X ly phan t d lieu mi oc c
B8: Lap lai B3
B9: close (Fd)
B10: close (Fidx)
Bkt: Ket thuc

Ham CreateIndex thc hien viec tao tap tin ch muc t tap tin d lieu va sap xep cac
phan t trong tap tin ch muc theo th t tang theo khoa nhan dien. Neu viec tao tap
tin ch muc thanh cong, ham tra ve gia tr 1, ngc lai ham tra ve gia tr 1. Ham
CreateIndex co prototype nh sau:
int CreateIndex (char * DataFile, char * IdxFile);
Noi dung cua ham CreateIndex:
int CreateIndex (char * DataFile, char * IdxFile)
{ FILE * Fd = fopen (DataFile, rb);
if (Fd == NULL)
return (-1);
FILE * Fidx = fopen (IdxFile, wb);
if (Fidx == NULL)
DataType a;
IdxType ai;
int SOT = sizeof(DataType);
int SOI = sizeof(IdxType);
long CurPos = 0;
while (!feof(Fd))
{ if (fread (&a, SOT, 1, Fd) < 1)
{ if (feof(Fd))
break;
return (Finished (Fd, Fidx, -1));
Trang: 80
}
ai.Key = a.Key;
ai.Pos = CurPos;
if (fwrite (&ai, SOI, 1, Fidx) < 1)
CurPos += SOT;
}
fclose (Fd);
fclose (Fidx);
if (FileNaturalMergeSort(IdxFile) == -1)
{ remove (IdxFile);
return (-1);
}
return (1);
}
Ham DisplayData thc hien ieu khien th t xuat hien cac phan t d lieu tren tap
tin d lieu da tren tap tin ch muc a c tao. Neu viec liet ke thanh cong, ham tra
ve gia tr 1, ngc lai ham tra ve gia tr 1. Ham DisplayData co prototype nh sau:
int DisplayData (char * DataFile, char * IdxFile);
Noi dung cua ham DisplayData:
int DisplayData (char * DataFile, char * IdxFile)
{ FILE * Fd = fopen (DataFile, rb);
if (Fd == NULL)
return (-1);
FILE * Fidx = fopen (IdxFile, rb);
if (Fidx == NULL)
DataType a;
IdxType ai;
int SOT = sizeof(DataType);
int SOI = sizeof(IdxType);
while (!feof(Fidx))
{ if (fread (&ai, SOI, 1, Fidx) < 1)
{ if (feof(Fidx))
return (Finished (Fd, Fidx, 1));
}
fseek(Fd, ai.Pos, SEEK_SET);
if (fread (&a, SOT, 1, Fd) < 1)
Output(a);
}
return (Finished (Fd, Fidx, 1));
}
Lu y:
Trang: 81
Ham Output thc hien viec xuat thong tin cua mot phan t d lieu ra thiet b xuat
thong tin. Ngoai ra, neu chung ta muon x ly d lieu trong phan t d lieu nay theo
th t ieu khien bi tap tin ch muc th chung ta cung co the viet mot ham thc
hien thao tac x ly thay cho ham Output nay.

Trong thuat toan nay chung ta phai thc hien t nhat 01 lan tao tap tin ch muc. e
tao tap tin ch muc chung ta phai thc hien N lan oc ghi a. Khi thc hien viec
liet ke cac phan t d lieu chung ta cung phai thc hien 2N lan oc a.
Nhc iem ln nhat trong thuat toan nay la chung ta phai cap nhat lai tap tin ch
muc khi co s thay oi d lieu tren tap tin d lieu.
Cau hoi va Bai tap

1. Trnh bay t tng cua cac thuat toan sap xep?
2. Trong cac thuat toan sap xep ban thch nhat la thuat toan nao? Thuat toan nao ban
khong thch nhat? Tai sao?
3. Trnh bay va cai at tat ca cac thuat toan sap xep noi, ngoai theo th t giam? Cho
nhan xet ve cac thuat toan nay?
4. Hay trnh bay nhng u khuyet iem cua moi thuat toan sap xep? Theo ban cach
khac phuc nhng nhc iem nay la nh the nao?
5. S dung ham random trong C e tao ra mot day M co 1.000 so nguyen. Van dung
cac thuat toan sap xep e sap xep cac phan t cua mang M theo th t tang dan ve
mat gia tr. Vi cung mot d lieu nh nhau, cho biet thi gian thc hien cac thuat
toan? Co nhan xet g oi vi cac thuat toan sap xep nay? Ban hay e xuat va cai at
thuat toan Quick-Sort trong trng hp khong dung e quy?
6. Thong tin ve moi so hang cua mot a thc bac n bao gom: He so la mot so thc,
Bac la mot so nguyen co gia tr t 0 en 100. Hay nh ngha cau truc d lieu e
lu tr cac a thc trong bo nh trong cua may tnh. Vi cau truc d lieu a c
nh ngha, hay van dung mot thuat toan sap xep va cai at chng trnh thc hien
viec sap xep cac so hang trong a thc theo th t tang dan cua cac bac.
7. Thong tin ve cac phong thi tai mot hoi ong thi bao gom: So phong la mot so
nguyen co gia tr t 1 en 200, Nha la mot ch cai in hoa t A Z, Kha nang
cha la mot so nguyen co gia tr t 10 250. Hay nh ngha cau truc d lieu e
lu tr cac phong thi nay trong bo nh trong cua may tnh. Vi cau truc d lieu a
c nh ngha, van dung cac thuat toan sap xep va cai at chng trnh thc hien
viec cac cong viec sau:
- Sap xep va in ra man hnh danh sach cac phong thi theo th t giam dan ve Kha
nang cha.
- Sap xep va in ra man hnh danh sach cac phong thi theo th t tang dan theo
Nha (T A Z), cac phong cung mot nha th sap xep theo th t tang dan theo
So phong.
Trang: 82
- Sap xep va in ra man hnh danh sach cac phong thi theo th t tang dan theo
Nha (T A Z), cac phong cung mot nha th sap xep theo th t giam dan theo
Kha nang cha.
8. Tao tap tin d lieu SONGUYEN.DAT gom 10000 so nguyen. Van dung cac thuat toan
sap xep tren file, hay cai at chng trnh e sap xep d lieu tren tap tin nay theo
th t tang dan ve gia tr cua cac so nguyen trong o. Cho biet thi gian thc hien
moi thuat toan? Co nhan xet g oi vi cac thuat toan nay?
9. Thong tin ve mot sinh vien bao gom: Ma so la mot so nguyen dng, Ho va em
la mot chuoi co toi a 20 ky t, Ten sinh vien la mot chuoi co toi a 10 ky t,
Ngay, thang, nam sinh la cac so nguyen dng, Phai La Nam hoac N, iem
trung bnh la cac so thc co gia tr t 0.00 10.00. Viet chng trnh nhap vao
danh sach sinh vien (t nhat la 10 sinh vien, khong nhap trung ma gia cac sinh vien
vi nhau) va lu tr danh sach nay vao tap tin co ten SINHVIEN.DAT, sau o van
dung cac thuat toan sap xep tren file e sap xep danh sach sinh vien theo th t tang
dan theo Ma sinh vien. In danh sach sinh vien trong file SINHVIEN.DAT sau khi sap
xep ra man hnh.
10. Vi tap tin d lieu co ten SINHVIEN.DAT trong bai tap 9, thc hien cac yeu cau sau:
- Tao cac tap tin ch muc theo cac khoa trong cac trng hp sau:
+ Ch muc sap xep theo Ma sinh vien tang dan;
+ Ch muc sap xep theo Ten sinh vien t A Z, neu cung ten th sap sep Ho va
em theo th t t A Z;
+ Ch muc sap xep theo iem trung bnh giam dan.
- Lu cac tap tin ch muc theo cac khoa nh trong ba trng hp neu tren vao
trong da vi cac ten tng ng la SVMASO.IDX, SVTH.IDX, SVDTB.IDX.
- Da vao cac tap tin ch muc, in ra toan bo danh sach sinh vien trong tap tin
SINHVIEN.DAT theo ung th s sap xep quy nh trong cac tap tin ch muc.
- Co nhan xet g khi thc hien viec sap xep d lieu tren tap tin theo ch muc.
11. Trnh bay va cai at cac thuat toan e cap nhat lai tap tin ch muc khi tap tin d
lieu b thay oi trong cac trng hp sau:
- Khi them 01 phan t d lieu vao tap tin d lieu.
- Khi huy 01 phan t d lieu trong tap tin d lieu.
- Khi hieu chnh thanh khoa ch muc cua 01 phan t d lieu trong tap tin d lieu.
12. Trnh bay va cai at cac thuat toan e minh hoa (mo phong) cac bc trong qua
trnh sap xep d lieu cho cac thuat toan sap xep noi (S dung cac giao dien o hoa
e cai at),
Trang: 83
Chng 4: DANH SACH (LIST)
4.1. Khai niem ve danh sach
Danh sach la tap hp cac phan t co kieu d lieu xac nh va gia chung co mot moi
lien he nao o.
So phan t cua danh sach goi la chieu dai cua danh sach. Mot danh sach co chieu dai
bang 0 la mot danh sach rong.
4.2. Cac phep toan tren danh sach
Tuy thuoc vao ac iem, tnh chat cua tng loai danh sach ma moi loai danh sach co
the co hoac ch can thiet co mot so phep toan (thao tac) nhat nh nao o. Noi chung,
tren danh sach thng co cac phep toan nh sau:
- Tao mi mot danh sach:
Trong thao tac nay, chung ta se a vao danh sach noi dung cua cac phan t, do
vay chieu dai cua danh sach se c xac nh. Trong mot so trng hp, chung ta
ch can khi tao gia tr va trang thai ban au cho danh sach.
- Them mot phan t vao danh sach:
Thao tac nay nham them mot phan t vao trong danh sach, neu viec them thanh
cong th chieu dai cua danh sach se tang len 1. Cung tuy thuoc vao tng loai danh
sach va tng trng hp cu the ma viec them phan t se c tien hanh au, cuoi
hay gia danh sach.
- Tm kiem mot phan t trong danh sach:
Thao tac nay se van dung cac thuat toan tm kiem e tm kiem mot phan t tren
danh sach thoa man mot tieu chuan nao o (thng la tieu chuan ve gia tr).
- Loai bo bt mot phan t ra khoi danh sach:
Ngc vi thao tac them, thao tac nay se loai bo bt mot phan t ra khoi danh sach
do vay, neu viec loai bo thanh cong th chieu dai cua danh sach cung b giam xuong
1. Thong thng, trc khi thc hien thao tac nay chung ta thng phai thc hien
thao tac tm kiem phan t can loai bo.
- Cap nhat (sa oi) gia tr cho mot phan t trong danh sach:
Thao tac nay nham sa oi noi dung cua mot phan t trong danh sach. Tng t nh
thao tac loai bo, trc khi thay oi thng chung ta cung phai thc hien thao tac tm
kiem phan t can thay oi.
- Sap xep th t cac phan t trong danh sach:
Trong thao tac nay chung ta se van dung cac thuat toan sap xep e sap xep cac
phan t tren danh sach theo mot trat t xac nh.
- Tach mot danh sach thanh nhieu danh sach:
Trang: 84
Thao tac nay thc hien viec chia mot danh sach thanh nhieu danh sach con theo mot
tieu thc chia nao o. Ket qua sau khi chia la tong chieu dai trong cac danh sach
con phai bang chieu dai cua danh sach ban au.
- Nhap nhieu danh sach thanh mot danh sach:
Ngc vi thao tac chia, thao tac nay tien hanh nhap nhieu danh sach con thanh mot
danh sach co chieu dai bang tong chieu dai cac danh sach con. Tuy vao tng trng
hp ma viec nhap co the la:
+ Ghep noi uoi cac danh sach lai vi nhau,
+ Tron xen lan cac phan t trong danh sach con vao danh sach ln theo mot trat
t nhat nh.
- Sao chep mot danh sach:
Thao tac nay thc hien viec sao chep toan bo noi dung cua danh sach nay sang mot
danh sach khac sao cho sau khi sao chep, hai danh sach co noi dung giong het nhau.
- Huy danh sach:
Thao tac nay se tien hanh huy bo (xoa bo) toan bo cac phan t trong danh sach.
Viec xoa bo nay tuy vao tng loai danh sach ma co the la xoa bo toan bo noi dung
hay ca noi dung lan khong gian bo nh lu tr danh sach.
4.3. Danh sach ac (Condensed List)
4.3.1. nh ngha
Danh sach ac la danh sach ma khong gian bo nh lu tr cac phan t c at lien
tiep nhau trong bo nh.
4.3.2. Bieu dien danh sach ac

e bieu dien danh sach ac chung ta s dung mot day (mang) cac phan t co kieu d
lieu la kieu d lieu cua cac phan t trong danh sach. Do vay, chung ta can biet trc so
phan t toi a cua mang cung chnh la chieu dai toi a cua danh sach thong qua mot
hang so nguyen. Ngoai ra, do chieu dai cua danh sach luon luon bien ong cho nen
chung ta cung can quan ly chieu dai thc cua danh sach thong qua mot bien nguyen.
Gia s chung ta quy c chieu dai toi a cua danh sach ac la 10000, khi o cau truc
d lieu e bieu dien danh sach ac nh sau:
const int MaxLen = 10000; // hoac: #define MaxLen 10000
int Length;
T CD_LIST[MaxLen]; // hoac: T * CD_LIST = new T[MaxLen];
Neu chung ta s dung c che cap phat ong e cap phat bo nh cho danh sach ac th
can kiem tra s thanh cong cua viec cap phat ong.
4.3.3. Cac thao tac tren danh sach ac
ay co nhieu thao tac a c trnh bay cac chng trc, do vay chung ta khong
trnh bay lai ma ch liet ke cho co he thong hoac trnh bay tom tat nhng noi dung
chnh cua cac thao tac nay.
Trang: 85
Cac thao tac c ban tren danh sach ac nh sau:
a. Khi tao danh sach (Initialize):

Trong thao tac nay ch n gian la chung ta cho chieu dai cua danh sach ve 0. Ham
khi tao danh sach ac nh sau:
void CD_Initialize(int &Len)
{ Len = 0;
return;
}
b. Tao mi danh sach/ Nhap danh sach:

Ham CD_Create_List co prototype:
int CD_Create_List(T M[], int &Len);
Ham tao danh sach ac co chieu dai toi a MaxLen. Ham tra ve chieu dai thc cua
danh sach sau khi tao.
Noi dung cua ham nh sau:
int CD_Create_List(T M[], int &Len)
{ if (Len > MaxLen)
Len = MaxLen;
for (int i = 0; i < Len; i++)
M[i] = Input_One_Element();
return (Len);
}
Lu y: Ham Input_One_Element thc hien nhap vao noi dung cua mot phan t co kieu
d lieu T va tra ve gia tr cua phan t mi nhap vao. Tuy vao tng trng hp
cu the ma chung ta viet ham Input_One_Element cho phu hp.
c. Them mot phan t vao trong danh sach:

Gia s chung ta can them mot phan t co gia tr NewValue vao trong danh sach M co
chieu dai Length tai v tr InsPos.
- Thuat toan:
B1: IF (Length = MaxLen)
Thc hien Bkt
//Di cac phan t t v tr InsPos->Length ra sau mot v tr
B2: Pos = Length+1
B3: IF (Pos = InsPos)
Thc hien B7
B4: M[Pos] = M[Pos-1]
B5: Pos--
B6: Lap lai B3
B7: M[InsPos] = NewValue //a phan t co gia tr NewValue vao v tr InsPos
B8: Length++ //Tang chieu dai cua danh sach len 1
Bkt: Ket thuc
Trang: 86
Ham CD_Insert_Element co prototype:
int CD_Insert_Element(T M[], int &Len, T NewValue, int InsPos);
Ham thc hien viec chen phan t co gia tr NewValue vao trong danh sach M co
chieu dai Len tai v tr InsPos. Ham tra ve chieu dai thc cua danh sach sau khi
chen neu viec chen thanh cong va ngc lai, ham tra ve gia tr -1. Noi dung cua
ham nh sau:
int CD_Insert_Element(T M[], int &Len, T NewValue, int InsPos)
{ if (Len == MaxLen)
return (-1);
for (int i = Len; i > InsPos; i--)
M[i] = M[i-1];
M[InsPos] = NewValue;
Len++;
return (Len);
}
d. Tm kiem mot phan t trong danh sach:

Thao tac nay chung ta s dung cac thuat toan tm kiem noi (Tm tuyen tnh hoac tm
nh phan) a c trnh bay trong Chng 2.
e. Loai bo bt mot phan t ra khoi danh sach:

Gia s chung ta can loai bo phan t tai v tr DelPos trong danh sach M co chieu dai
Length (Trong mot so trng hp co the chung ta phai thc hien thao tac tm kiem
e xac nh v tr cua phan t can xoa).
- Thuat toan:
B1: IF (Length = 0 OR DelPos > Len)
Thc hien Bkt
//Di cac phan t t v tr DelPos+1->Length ra trc mot v tr
B2: Pos = DelPos
B3: IF (Pos = Length)
Thc hien B7
B4: M[Pos] = M[Pos+1]
B5: Pos++
B6: Lap lai B3
B7: Length-- //Giam chieu dai cua danh sach i 1
Bkt: Ket thuc
Ham CD_Delete_Element co prototype:
int CD_Delete_Element(T M[], int &Len, int DelPos);
Ham thc hien viec xoa phan t tai v tr DelPos trong danh sach M co chieu dai
Len. Ham tra ve chieu dai thc cua danh sach sau khi xoa neu viec xoa thanh
cong va ngc lai, ham tra ve gia tr -1. Noi dung cua ham nh sau:
Trang: 87
int CD_Delete_Element(T M[], int &Len, int DelPos)
{ if (Len == 0 || DelPos >= Len)
return (-1);
for (int i = DelPos; i < Len-1; i++)
M[i] = M[i+1];
Len--;
return (Len);
}
f. Cap nhat (sa oi) gia tr cho mot phan t trong danh sach:
Gia s chung ta can sa oi phan t tai v tr ChgPos trong danh sach M co chieu dai
Length thanh gia tr mi NewValue. Thao tac nay ch n gia la viec gan lai gia tr
mi cho phan t can thay oi: M[ChgPos] = NewValue;
Trong mot so trng hp, trc tien chung ta phai thc hien thao tac tm kiem phan
t can thay oi gia tr e xac nh v tr cua no sau o mi thc hien phep gan nh
tren.
g. Sap xep th t cac phan t trong danh sach:

Thao tac nay chung ta s dung cac thuat toan sap xep noi (tren mang) a trnh bay
trong Chng 3.
h. Tach mot danh sach thanh nhieu danh sach:

Tuy thuoc vao tng yeu cau cu the ma viec tach mot danh sach thanh nhieu danh
sach co the thc hien theo nhng tieu thc khac nhau:
+ Co the phan phoi luan phien theo cac ng chay nh a trnh bay trong cac
thuat toan sap xep theo phng phap tron Chng 3;
+ Co the phan phoi luan phien tng phan cua danh sach can tach cho cac danh
sach con. day chung ta se trnh bay theo cach phan phoi nay;
+ Tach cac phan t trong danh sach thoa man mot ieu kien cho trc.
Gia s chung ta can tach danh sach M co chieu dai Length thanh cac danh sach con
SM1, SM2 co chieu dai tng ng la SLen1, SLen2.
- Thuat toan:
// Kiem tra tnh hp le cua SLen1 va SLen2: SLen1 + SLen2 = Length
B1: IF (SLen1 Length)
B1.1: SLen1 = Length
B1.2: SLen2 = 0
B2: IF (SLen2 Length)
B2.1: SLen2 = Length
B2.2: SLen1 = 0
B3: IF (SLen1 + Slen2 Length)
SLen2 = Length SLen1
B4: IF (SLen1 < 0)
SLen1 = 0
B5: IF (SLen2 < 0)
SLen2 = 0
Trang: 88
// Chep SLen1 phan t au trong M vao SM1
B6: i = 1, si = 1
B7: IF (i > SLen1)
Thc hien B11
B8: SM1[si] = M[i]
B9: i++, si++
B10: Lap lai B7
// Chep SLen2 phan t cuoi trong M vao SM2
B11: si = 1
B12: IF (i > Length)
Thc hien Bkt
B13: SM2[si] = M[i]
B14: i++, si++
B15: Lap lai B12
Bkt: Ket thuc
Ham CD_Split co prototype:
void CD_Split(T M[], int Len, T SM1[], int &SLen1, T SM2[], int &SLen2);
Ham thc hien viec sao chep noi dung SLen1 phan t au tien trong danh sach M
vao trong danh con SM1 va sao chep SLen2 phan t cuoi cung trong danh sach M
vao trong danh sach con SM2. Ham hieu chnh lai SLen1, SLen2 neu can thiet.
void CD_Split(T M[], int Len, T SM1[], int &SLen1, T SM2[], int &SLen2)
{ if (SLen1 >= Len)
{ SLen1 = Len;
SLen2 = 0;
}
if (SLen2 >= Len)
{ SLen2 = Len;
SLen1 = 0;
}
if (SLen1 < 0) SLen1 = 0;
if (SLen2 < 0) SLen2 = 0;
if (SLen1 + SLen2 != Len)
SLen2 = Len SLen1;
for (int i = 0; i < SLen1; i++)
SM1[i] = M[i];
for (int j = 0; i < Len; i++, j++)
SM2[j] = M[i];
return;
}
i. Nhap nhieu danh sach thanh mot danh sach:

Tuy thuoc vao tng yeu cau cu the ma viec nhap nhieu danh sach thanh mot danh
sach co the thc hien theo cac phng phap khac nhau, co the la:
Trang: 89
+ Ghep noi uoi cac danh sach lai vi nhau;
+ Tron xen lan cac phan t trong danh sach con vao danh sach ln theo mot trat
t nhat nh nh chung ta a trnh bay trong cac thuat toan tron Chng 3.
ay chung ta trnh bay cach ghep cac danh sach thanh mot danh sach.
Gia s chung ta can ghep cac danh sach SM1, SM2 co chieu dai SLen1, SLen2 vao
thanh mot danh sach M co chieu dai Length = SLen1 + SLen2 theo th t t SM1 roi
en SM2.
- Thuat toan:
// Kiem tra kha nang cha cua M: SLen1 + SLen2 MaxLen
B1: IF (SLen1 + SLen2 > MaxLen)
Thc hien Bkt
// Chep SLen1 phan t au trong SM1 vao au M
B2: i = 1
B3: IF (i > SLen1)
Thc hien B7
B4: M[i] = SM1[i]
B5: i++
B6: Lap lai B3
// Chep SLen2 phan t au trong SM2 vao sau M
B7: si = 1
B8: IF (si > SLen2)
Thc hien Bkt
B9: M[i] = M2[si]
B10: i++, si++
B11: Lap lai B8
Bkt: Ket thuc
Ham CD_Concat co prototype:
int CD_Concat (T SM1[], int SLen1, T SM2[], int SLen2, T M[], int &Len);
Ham thc hien viec sao ghep noi dung hai danh sach SM1, SM2 co chieu dai
tng ng SLen1, SLen2 ve danh sach M co chieu dai Len = SLen1 + SLen2 theo
th t SM1 en SM2. Ham tra ve chieu dai cua danh sach M sau khi ghep neu viec
ghep thanh cong, trong trng hp ngc lai ham tra ve gia tr -1.
int CD_Concat (T SM1[], int SLen1, T SM2[], int SLen2, T M[], int &Len)
{ if (SLen1 + SLen2 > MaxLen)
return (-1);
for (int i = 0; i < SLen1; i++)
M[i] = SM1[i];
for (int j = 0; j < SLen2; i++, j++)
M[i] = SM2[j];
Len = SLen1 + SLen2;
Trang: 90
return (Len);
}
j. Sao chep mot danh sach:

Gia s chung ta can sao chep noi dung dach sach M co chieu dai Length vao thanh
danh sach CM co cung chieu dai.
- Thuat toan:
B1: i = 1
B2: IF (i > Length)
Thc hien Bkt
B3: CM[i] = M[i]
B4: i++
B5: Lap lai B2
Bkt: Ket thuc
Ham CD_Copy co prototype:
int CD_Copy (T M[], int Len, T CM[]);
Ham thc hien viec sao chep noi dung danh sach M co chieu dai Len ve danh
sach CM co cung chieu dai. Ham tra ve chieu dai cua danh sach CM sau khi sao
chep.
int CD_Copy (T M[], int Len, T CM[])
{ for (int i = 0; i < Len; i++)
CM[i] = M[i];
return (Len);
}
k. Huy danh sach:

Trong thao tac nay, neu danh sach c cap phat ong th chung ta tien hanh huy
bo (xoa bo) toan bo cac phan t trong danh sach bang toan t huy bo (trong C/C++
la free/delete). Neu danh sach c cap phat tnh th viec huy bo ch la tam thi cho
chieu dai cua danh sach ve 0 con viec thu hoi bo nh se do ngon ng t thc hien.
4.3.4. u nhc iem va ng dung
a. u nhc iem:
Do cac phan t c lu tr lien tiep nhau trong bo nh, do vay danh sach ac co
cac u nhc iem sau ay:
- Mat o s dung bo nh cua danh sach ac la toi u tuyet oi (100%);
- Viec truy xuat va tm kiem cac phan t cua danh sach ac la de dang v cac phan
t ng lien nhau nen chung ta ch can s dung ch so e nh v v tr cac phan t
trong danh sach (nh v a ch cac phan t);
- Viec them, bt cac phan t trong danh sach ac co nhieu kho khan do chung ta
phai di di cac phan t khac i qua cho khac.
Trang: 91
b. ng dung cua danh sach ac:
Danh sach ac c ng dung nhieu trong cac cau truc d lieu mang: mang 1 chieu,
mang nhieu chieu; Mang cap phat tnh, mang cap phat ong; ma chung ta a
nghien cu va thao tac kha nhieu trong qua trnh lap trnh tren nhieu ngon ng lap
trnh khac nhau.
4.4. Danh sach lien ket (Linked List)

4.4.1. nh ngha
Danh sach lien ket la tap hp cac phan t ma gia chung co mot s noi ket vi nhau
thong qua vung lien ket cua chung.
S noi ket gia cac phan t trong danh sach lien ket o la s quan ly, rang buoc lan
nhau ve noi dung cua phan t nay va a ch nh v phan t kia. Tuy thuoc vao mc o
va cach thc noi ket ma danh sach lien ket co the chia ra nhieu loai khac nhau:
- Danh sach lien ket n;
- Danh sach lien ket oi/kep;
- Danh sach a lien ket;
- Danh sach lien ket vong (vong n, vong oi).
Moi loai danh sach se co cach bieu dien cac phan t (cau truc d lieu) rieng va cac
thao tac tren o. Trong tai lieu nay chung ta ch trnh bay 02 loai danh sach lien ket c
ban la danh sach lien ket n va danh sach lien ket oi.
4.4.2. Danh sach lien ket n (Singly Linked List)
A. Cau truc d lieu:

Noi dung cua moi phan t trong danh sach lien ket (con goi la mot nut) gom hai
vung: Vung d lieu va Vung lien ket va co cau truc d lieu nh sau:
typedef struct SLL_Node
{ T Key;
InfoType Info;
SLL_Node * NextNode; // Vung lien ket quan ly a ch phan t ke tiep
} SLL_OneNode;
Tng t nh trong cac chng trc, ay e n gian chung ta cung gia thiet
rang vung d lieu cua moi phan t trong danh sach lien ket n ch bao gom mot
thanh phan khoa nhan dien (Key) cho phan t o. Khi o, cau truc d lieu tren co
the viet lai n gian nh sau:
{ T Key;
SLL_Node * NextNode; // Vung lien ket quan ly a ch phan t ke tiep
} SLL_OneNode;
typedef SLL_OneNode * SLL_Type;
Trang: 92
e quan ly mot danh sach lien ket chung ta co the s dung nhieu phng phap khac
nhau va tng ng vi cac phng phap nay chung ta se co cac cau truc d lieu
khac nhau, cu the:
- Quan ly a ch phan t au danh sach:
SLL_Type SLList1;
Hnh anh minh hoa:
SLList1 NULL
15 10 20 18 40 35 30
- Quan ly a ch phan t au va cuoi danh sach:

typedef struct SLL_PairNode
{ SLL_Type SLLFirst;
SLL_Type SLLLast;
} SLLP_Type;
SLLP_Type SLList2;
Hnh anh minh hoa:
SLLFirst SLLLast NULL
15 10 20 18 40 35 30
- Quan ly a ch phan t au, a ch phan t cuoi va so phan t trong danh sach:

typedef struct SLL_PairNNode
{ SLL_Type SLLFirst;
SLL_Type SLLLast;
unsigned NumNode;
} SLLPN_Type;
SLLPN_Type SLList3;
Hnh anh minh hoa:
SLLFirst SLLLast NULL
15 10 20 18 40 35 30
NumNode = 7
B. Cac thao tac tren danh sach lien ket n:

Vi moi cach quan ly khac nhau cua danh sach lien ket n , cac thao tac cung se
co s khac nhau ve mat chi tiet song noi dung c ban t co s khac nhau. Do vay,
ay chung ta ch trnh bay cac thao tac theo cach quan ly th nhat (quan ly a ch
cua phan t au danh sach lien ket n), cac cach quan ly khac sinh vien t van
dung e ieu chnh cho thch hp.
Trang: 93
Trong thao tac nay ch n gian la chung ta cho gia tr con tro quan ly a ch phan
t au danh sach ve con tro NULL. Ham khi tao danh sach lien ket n nh sau:
void SLL_Initialize(SLL_Type &First)
{ First = NULL;
return;
}
Hnh anh minh hoa:
SLList1 NULL
b. Tao mi mot phan t / nut:

Gia s chung ta can tao mi mot phan t co thanh phan d lieu la NewData.
- Thuat toan:
B1: First = new SLL_OneNode
B2: IF (First = NULL)
Thc hien Bkt
B3: First->NextNode = NULL
B4: First->Key = NewData
Bkt: Ket thuc
Ham SLL_Create_Node co prototype:
SLL_Type SLL_Create_Node(T NewData);
Ham tao mi mot nut co thanh phan d lieu la NewData, ham tra ve con tro tro
ti a ch cua nut mi tao. Neu khong u bo nh e tao, ham tra ve con tro
NULL.
SLL_Type SLL_Create_Node(T NewData)
{ SLL_Type Pnode = new SLL_OneNode;
if (Pnode != NULL)
{ Pnode->NextNode = NULL;
Pnode->Key = NewData;
}
return (Pnode);
}
- Minh hoa thuat toan:
Gia s chung ta can tao nut co thanh phan d lieu la 20: NewData = 20
Pnode = new SLL_OneNode
Pnode
Pnode->NextNode = NULL
Pnode->Key = NewData
Trang: 94
Pnode 20 NULL

Gia s chung ta can them mot phan t co gia tr thanh phan d lieu la NewData vao
trong danh sach. Viec them co the dien ra au, cuoi hay gia danh sach lien ket.
Do vay, ay chung ta trnh bay 3 thao tac them rieng biet nhau:
- Thuat toan them phan t vao au danh sach lien ket n:
B1: NewNode = SLL_Create_Node (NewData)
B2: IF (NewNode = NULL)
Thc hien Bkt
B3: NewNode->NextNode = SLList // Noi SLList vao sau NewNode
B4: SLList = NewNode // Chuyen vai tro ng au cua NewNode cho SLList
Bkt: Ket thuc
Gia s chung ta can them nut co thanh phan d lieu la 25: NewData = 25
NewNode
25 NULL
NULL
SLList 10 20 18 40 35 30
NewNode->NextNode = SLList:
NewNode
25
NULL
SLList 10 20 18 40 35 30
SLList = NewNode:
NewNode
25
SLList NULL
10 20 18 40 35 30
Ket qua sau khi chen:

SLList NULL
25 10 20 18 40 35 30
- Thuat toan them phan t vao cuoi danh sach lien ket n:
Trang: 95
Thc hien Bkt
B3: IF (SLList = NULL)
B3.1: SLList = NewNode
B3.2: Thc hien Bkt
// Tm en a ch cua phan t cuoi cung trong danh sach lien ket n
B4: CurNode = SLList
B5: IF (CurNode->NextNode = NULL)
Thc hien B8
B6: CurNode = CurNode->NextNode // Chuyen qua nut ke tiep
B7: Lap lai B5
B8: CurNode->NextNode = NewNode // Noi NewNode vao sau CurNode
Bkt: Ket thuc
NULL
NewNode 25
SLList CurNode
15 10 20 18 40 35 NULL
CurNode->NextNode = NewNode:
NULL
NewNode 25
SLList CurNode
15 10 20 18 40 35

SLList NULL
15 10 20 18 40 35 25
- Thuat toan them phan t vao gia danh sach lien ket n:
Gia s chung ta can them mot phan t co gia tr thanh phan d lieu la NewData
vao trong danh sach SLList vao ngay sau nut co a ch InsNode. Trong thc te
nhieu khi chung ta phai thc hien thao tac tm kiem e xac nh a ch InsNode,
ay gia s chung ta a xac nh c a ch nay.
Thc hien Bkt
B3: IF (InsNode->NextNode = NULL)
B3.1: InsNode->NextNode = NewNode
B3.2: Thc hien Bkt
Trang: 96
// Noi cac nut ke sau InsNode vao sau NewNode
B4: NewNode->NextNode = InsNode->NextNode
// Chuyen moi lien ket gia InsNode vi nut ke cua no ve NewNode
B5: InsNode->NextNode = NewNode
Bkt: Ket thuc
Gia s chung ta can them nut co thanh phan d lieu la 25 vao sau nut co a ch
InsNode nh sau: NewData = 25
NewNode 25 NULL
SLList InsNode
15 10 20 18 40 35 NULL
NewNode->NextNode = InsNode->NextNode:
NewNode 25
SLList InsNode
15 10 20 18 40 35 NULL
InsNode->NextNode = NewNode:
NewNode 25
SLList
15 10 20 18 40 35 NULL
InsNode
SLList NULL
15 10 20 25 18 40 35

Cac ham them phan t tng ng vi cac trng hp co prototype nh sau:
SLL_Type SLL_Add_First(SLL_Type &SList, T NewData);
SLL_Type SLL_Add_Last(SLL_Type &SList, T NewData);
SLL_Type SLL_Add_Mid(SLL_Type &SList, T NewData, SLL_Type &InsNode);
Ham thc hien viec chen phan t co gia tr thanh phan d lieu NewData vao trong
danh sach lien ket n quan ly bi con tro au danh sach SList tng ng vi 3
trng hp: Them au, them cuoi, them gia. Cac ham tra ve gia tr la a ch cua
nut au tien neu viec them thanh cong. Trong trng hp ngc lai, cac ham tra
ve con tro NULL.
Rieng oi vi trng hp them gia, ham SLL_Add_Mid thc hien viec them vao
ngay sau nut co a ch InsNode. Noi dung cua cac ham nh sau:
Trang: 97
SLL_Type SLL_Add_First(SLL_Type &SList, T NewData)
{ SLL_Type NewNode = SLL_Create_Node(NewData);
if (NewNode == NULL)
return (NULL);
NewNode->NextNode = SList;
SList = NewNode;
return (SList);
}
//=================================================================
SLL_Type SLL_Add_Last(SLL_Type &SList, T NewData)
return (NULL);
if (SList == NULL)
{ SList = NewNode;
return (SList);
}
SLL_Type CurNode = SList;
while (CurNode->NextNode != NULL)
CurNode = CurNode->NextNode;
CurNode->NextNode = NewNode;
return (SList);
}
//=================================================================
SLL_Type SLL_Add_Mid(SLL_Type &SList, T NewData, SLL_Type &InsNode)
return (NULL);
if (InsNode->NextNode == NULL)
{ InsNode->NextNode = NewNode;
return (SList);
}
NewNode->NextNode = InsNode->NextNode;
InsNode->NextNode = NewNode;
return (SList);
}
d. Duyet qua cac nut trong danh sach:

ay la mot thao tac thng xuyen xay ra tren danh sach lien ket n noi chung va
cac danh sach khac noi rieng e thc hien thao tac x ly cac nut hoac x ly d lieu
tai cac nut. Co nhieu thao tac x ly tuy tng trng hp va yeu cau song ay n
gian chung ta ch duyet e xem noi dung thanh phan d lieu trong danh sach.
- Thuat toan:
B2: IF (CurNode = NULL)
Thc hien Bkt
Trang: 98
B3: OutputData(CurNode->Key) // Xuat gia tr thanh phan d lieu trong 1 nut
B4: CurNode = CurNode->NextNode
B5: Lap lai B2
Bkt: Ket thuc
Ham SLL_Travelling co prototype:
void SLL_Travelling(SLL_Type SList);
Ham duyet qua cac nut trong danh sach lien ket n quan ly bi a ch nut au
tien thong qua SList e xem noi dung thanh phan d lieu cua moi nut.
void SLL_Travelling (SLL_Type SList)
{ SLL_Type CurNode = SList;
while (CurNode != NULL)
{ OutputData(CurNode->Key);
}
return;
}
Lu y:
Ham OutputData thc hien viec xuat noi dung cua mot bien co kieu d lieu T. Tuy
vao tng trng hp cu the ma chung ta viet ham OutputData cho phu hp.
e. Tm kiem mot phan t trong danh sach:

Gia s chung ta can tm kiem xem trong danh sach lien ket n co ton tai nut co
thanh phan d lieu la SearchData hay khong. Thao tac nay chung ta van dung thuat
toan tm tuyen tnh e tm kiem.
- Thuat toan:
B2: IF (CurNode = NULL OR CurNode->Key = SearchData)
Thc hien Bkt
B4: Lap lai B2
Bkt: Ket thuc
Ham SLL_Searching co prototype:
SLL_Type SLL_Searching(SLL_Type SList, T SearchData);
Ham thc hien viec tm kiem nut co thanh phan d lieu la SearchData tren danh
sach lien ket n quan ly bi a ch nut au tien thong qua SList. Ham tra ve a
ch cua nut au tien trong danh sach khi tm thay, ngc lai ham tra ve con tro
NULL.
Trang: 99
SLL_Type SLL_Searching(SLL_Type SList, T SearchData)
{ SLL_Type CurNode = SList;
{ if (CurNode->Key == SearchData)
break;
}
return (CurNode);
}
f. Loai bo bt mot phan t ra khoi danh sach:

Gia s chung ta can loai bo phan t co gia tr thanh phan d lieu la DelData trong
danh sach lien ket n. e thc hien ieu nay trc tien chung ta phai thc hien
thao tac tm kiem a ch cua nut co thanh phan d lieu la DelData, sau o mi thc
hien thao tac loai bo neu tm thay. Tuy nhien trong qua trnh tm kiem, neu tm thay
chung ta phai ghi nhan a ch cua nut ng ngay trc nut tm thay la PreDelNode.
- Thuat toan:
// Tm kiem nut co Key la DelData trong danh sach
B1: DelNode = SLList
B2: PreDelNode = NULL
B3: IF (DelNode = NULL)
Thc hien Bkt
B4: IF (DelNode->Key=DelData)
Thc hien B8
B5: PreDelNode = DelNode
B6: DelNode = DelNode->NextNode
B7: Lap lai B3
// Loai bo nut tai a ch DelNode ra khoi danh sach
B8: IF (PreDelNode = NULL) // Loai bo nut au tien trong danh sach
B8.1: SLList = SLList->NextNode
B8.2: Thc hien B10
// Lien ket cac not sau DelNode ve nut PreDelNode
B9: PreDelNode->NextNode = DelNode->NextNode
// Cat moi lien ket gia DelNode vi cac nut con lai trong danh sach
// va huy DelNode
B10: DelNode->NextNode = NULL
B11: delete DelNode
Bkt: Ket thuc
Ham SLL_Delete_Node co prototype:
int SLL_Delete_Node (SLL_Type &SList, T DelData);
Trang: 100
Ham thc hien viec xoa phan t co thanh phan d lieu la DelData trong danh sach
lien ket quan ly bi con tro au SList. Ham tra ve gia tr 1 neu viec xoa thanh
cong va ngc lai, ham tra ve gia tr -1. Noi dung cua ham nh sau:
int SLL_Delete_Node (SLL_Type &SList, T DelData)
{ SLL_Type DelNode = SList;
SLL_Type PreDelNode = NULL;
while (DelNode != NULL)
{ if (DelNode->Key == DelData)
break;
PreDelNode = DelNode;
DelNode = DelNode->NextNode;
}
if (DelNode == NULL)
return (-1);
if (PreDelNode == NULL)
SList = SList->NextNode;
else
PreDelNode->NextNode = DelNode->NextNode;
DelNode->NextNode = NULL;
delete DelNode;
return (1);
}
+ Gia s chung ta can huy nut co thanh phan d lieu la 25: DelData = 25
SLList NULL
25 10 20 18 40 35 30
DelNode
SLList = SLList->NextNode
DelNode SLList NULL
25 10 20 18 40 35 30
DelNode->NextNode = NULL
DelNode SLList NULL
25 10 20 18 40 35 30
NULL
Ket qua sau khi huy:
SLList
10 20 18 40 35 30 NULL
Trang: 101
+ Bay gi gia s chung ta can huy nut co thanh phan d lieu la 20: DelData = 20
SLList DelNode NULL
25 10 20 18 40 35 30
PreDelNode
PreDelNode->NextNode = DelNode->Next
SLList DelNode NULL
25 10 20 18 40 35 30
PreDelNode
DelNode->Next = NULL
SLList DelNode NULL NULL
25 10 20 18 40 35 30
PreDelNode

SLList
25 10 18 40 35 30 NULL
g. Huy danh sach:

Thao tac nay thc chat la thc hien nhieu lan thao tac huy mot nut.
- Thuat toan:
B1: IF (SLList = NULL)
Thc hien Bkt
B2: TempNode = SLList
B3: SLList = SLList->NextNode
B4: TempNode->NextNode = NULL
B5: delete TempNode
B6: Lap lai B1
Bkt: Ket thuc
- Cai at:
Ham SLL_Delete co prototype:
void SLL_Delete (SLL_Type &SList);
Ham thc hien viec huy toan bo danh sach SList.
void SLL_Delete (SLL_Type &SList)
{ SLL_Type TempNode = SList;
while (SList != NULL)
{ SList = SList->NextNode;
TempNode->NextNode = NULL;
Trang: 102
delete TempNode;
TempNode = SList;
}
return ;
}
h. Tao mi danh sach/ Nhap danh sach:

Viec tao mi mot danh sach lien ket n thc chat la chung ta lien tuc thc hien thao
tac them mot phan t vao danh sach ma ban au danh sach nay la mot danh sach
rong. Co the s dung mot trong ba ham them phan t e them phan t, ay chung
ta s dung ham SLL_Add_First.
Gia s chung ta can tao danh sach lien ket n co N phan t.
- Thuat toan:
B1: SLL_Initialize(SLList)
B2: i = 1
B3: IF (i > N)
Thc hien Bkt
B4: NewData = InputNewData() // Nhap gia tr cho bien NewData
B5: SLL_Add_First(SLList, NewData)
B6: i++
B7: Lap lai B3
Bkt: Ket thuc
Ham SLL_Create co prototype:
SLL_Type SLL_Create(SLL_Type &SList, int N);
Ham tao danh sach lien ket n co N nut quan ly bi a ch nut au tien thong
qua SList. Ham tra ve a ch cua nut au tien trong danh sach neu viec tao thanh
cong, ngc lai ham tra ve con tro NULL.
SLL_Type SLL_Create(SLL_Type &SList, int N)
{ SLL_Initialize(SList);
T NewData;
for (int i = 0; i < N; i++)
{ NewData = InputNewData();
if (SLL_Add_First(SList, NewData) == NULL)
{ SLL_Delete (SList);
break;
}
}
return (SList);
}
Lu y:
Trang: 103
Ham InputNewData thc hien viec nhap vao noi dung cua mot bien co kieu d lieu
T va tra ve gia tr mi nhap vao. Tuy vao tng trng hp cu the ma chung ta viet
ham InputNewData cho phu hp.
i. Tach mot danh sach thanh nhieu danh sach:

Tng t nh danh sach ac, viec tach mot danh sach lien ket n thanh nhieu danh
sach lien ket n khac nhau cung co nhieu tieu thc khac nhau ma chung ta se thc
hien theo cac cach khac nhau. Ngoai ra viec tach cung se khac nhau trong trng
hp co hay khong gi lai danh sach ban au. ay chung ta thc hien viec tach cac
nut trong danh sach lien ket n SLList thanh hai danh sach lien ket n con SLList
va SLList1 luan phien theo cac ng chay t nhien va khong gi lai danh sach lien
ket ban au. Cac trng hp khac sinh vien t van dung e thao tac.
- Thuat toan:
B2: SLList1 = SLList
B3: LastNode1 = NULL, LastNode2 = NULL
// Cat cac nut t sau ng chay t nhien th nhat ve SLList1
B4: IF (CurNode = NULL OR CurNode->NextNode = NULL)
Thc hien Bkt
B5: IF (CurNode->Key > CurNode->NextNode->Key)
B5.1: LastNode1 = CurNode
B5.2: SLList1 = SLList1->NextNode
B5.3: CurNode = CurNode->NextNode
B5.4: LastNode1->NextNode = NULL
B5.5: Thc hien B8
B6: CurNode = CurNode->NextNode, SLList1 = SLList1->NextNode
B7: Lap lai B4
// Cat cac nut t sau ng chay t nhien th hai ve SLList
Thc hien Bkt
B9.4: Thc hien B12
B11: Lap lai B8
// Phan phoi (gi lai) ng chay ke tiep trong SLList
B12: LastNode1->NextNode = CurNode
Thc hien Bkt
Trang: 104
B14.4: Thc hien B17
B16: Lap lai B13
// Phan phoi (gi lai) ng chay ke tiep trong SLList1
B17: LastNode2->NextNode = CurNode
Thc hien Bkt
B19.4: Lap lai B12
B21: Lap lai B18
Bkt: Ket thuc
Ham SLL_Split co prototype:
SLL_Type SLL_Split(SLL_Type &SList, SLL_Type &SList1);
Ham thc hien viec phan phoi bt cac ng chay t nhien trong SList sang
SList1. Ham tra ve con tro tro ti a ch phan t au tien trong SList1.
SLL_Type SLL_Split(SLL_Type &SList, SLL_Type &SList1)
{ SList1 = SList;
if (SList1 == NULL)
return (NULL);
SLL_Type Last1;
SLL_Type Last2;
while (SList1->NextNode != NULL)
{ if (SList1->Key > SList1->NextNode->Key)
break;
SList1 = SList1->NextNode;
}
if (SList1->NextNode != NULL)
Last1 = SList1;
Last1->NextNode = NULL;
SLL_Type CurNode = SList1;
if (CurNode == NULL)
return (NULL);
{ if (CurNode->Key > CurNode->NextNode->Key)
break;
Trang: 105
}
if (CurNode->NextNode == NULL)
return (SList1);
Last2 = CurNode;
{ Last1->NextNode = CurNode;
break;
break;
Cur Node = CurNode->NextNode;
}
break;
Last1 = CurNode;
Last2->NextNode = CurNode;
break;
break;
Cur Node = CurNode->NextNode;
}
break;
Last2 = CurNode;
}
return (SList1);
}
j. Nhap nhieu danh sach thanh mot danh sach:

Tng t, viec nhap nhieu danh sach thanh mot danh sach chung ta thc hien theo
hai trng hp khac nhau:
+ Tron xen lan cac phan t trong danh sach con vao thanh mot danh sach ln
theo mot trat t nhat nh.
Ngoai ra viec nhap co the gi lai cac danh sach con ban au hoac khong gi lai cac
danh sach con ban au. ay chung ta trnh bay theo cach khong gi lai cac danh
sach con ban au va trnh bay theo hai trng hp:
+ Ghep noi uoi hai danh sach lai vi nhau;
Trang: 106
+ Tron hai danh sach lai vi nhau theo cac ng chay t nhien thanh mot danh
sach co chieu dai ln hn.
Gia s chung ta can nhap hai danh sach SLList1, SLList2 lai vi nhau.
- Thuat toan ghep danh sach SLList2 vao sau SLList1:
B1: IF (SLList1 = NULL)
B1.1: SLList1 = SLList2
B1.2: Thc hien Bkt
Thc hien Bkt
// Lay a ch nut cuoi cung trong SLList1
B3: LastNode = SLList1
B4: IF (LastNode->NextNode = NULL)
Thc hien B7
B5: LastNode = LastNode->NextNode
B6: Lap lai B4
// Ghep SLList2 vao sau LastNode
B7: LastNode->NextNode = SLList2
Bkt: Ket thuc
- Thuat toan tron danh sach SLList2 va SLList1 thanh SLList theo cac ng chay
t nhien:
B1.1: SLList = SLList2
B1.2: Thc hien Bkt
B2.1: SLList = SLList1
B2.2: Thc hien Bkt
// Lay nut co d lieu nho hn trong 2 nut au cua 2 danh sach a ve SLList
B3: IF (SLList1->Key SLList2->Key)
B3.1: TempNode = SLList1
B4: ELSE
B4.1: TempNode = SLList2
B6.1: TempNode->NextNode = SLList2
B6.2: Thc hien Bkt
B7.1: TempNode->NextNode = SLList1
B7.2: Thc hien Bkt
B8: IF (SLList1->Key SLList2->Key) AND (TempNode->Key SLList1->Key)
B8.1: MinNode = SLList1
Trang: 107
B9: ELSE
B9.1: MinNode = SLList2
B10: TempNode->NextNode = MinNode
B11: MinNode->NextNode = NULL
B12: TempNode = MinNode
B13: Lap lai B6
Bkt: Ket thuc
- Cai at:
Cac ham nhap danh sach co prototype:
SLL_Type SLL_Concat (SLL_Type &SList1, SLL_Type &SList2);
SLL_Type SLL_Merge(SLL_Type &SList1, SLL_Type &SList2, SLL_Type &SList);
Ham thc hien viec nhap cac nut trong hai danh sach SList1, SList2 thanh mot
danh sach theo th t nh hai thuat toan va trnh bay. Ham tra ve a ch cua nut
au cua danh sach sau khi ghep.
SLL_Type SLL_Concat (SLL_Type &SList1, SLL_Type &SList2)
{ if (SList1 == NULL)
{ SList1 = SList2;
return (SList1);
}
if (SList2 == NULL)
return (SList1);
SLL_Type LastNode = SList1;
while (LastNode->NextNode != NULL)
LastNode = LastNode->NextNode;
LastNode->NextNode = SList2;
return (SList1);
}
//================================================================
SLL_Type SLL_Merge (SLL_Type &SList1, SLL_Type &SList2, SLL_Type &SList)
{ if (SList1 == NULL)
{ SList = SList2;
return (SList);
}
if (SList2 == NULL)
{ SList = SList1;
return (SList);
}
SLL_Type LastNode = NULL;
SLL_Type TempNode;
while (SList1 != NULL && SList2 != NULL)
{ if (SList1->Key <= SList2->Key)
{ TempNode = SList1;
Trang: 108
if (LastNode == NULL)
SList = LastNode = TempNode;
else
{ LastNode->NextNode = TempNode;
LastNode = TempNode;
}
if (SList1 == NULL)
break;
if (SList1->Key < LastNode->Key)
while (SList2 != NULL)
{ LastNode->Next = SList2;
LastNode->NextNode = NULL;
if (SList2 == NULL || SList2->Key < LastNode->Key)
break;
}
}
else
{ TempNode = SList2;
if (LastNode == NULL)
SList = LastNode = TempNode;
else
{ LastNode->NextNode = TempNode;
LastNode = TempNode;
}
if (SList2 == NULL)
break;
if (SList2->Key < LastNode->Key)
while (SList1 != NULL)
{ LastNode->Next = SList1;
LastNode->NextNode = NULL;
if (SList1 == NULL || SList1->Key < LastNode->Key)
break;
}
}
}
if (SList1 == NULL)
else
return (SList);
}
Trang: 109
k. Sap xep th t cac phan t trong danh sach:
Thao tac nay chung ta co the van dung cac thuat toan sap xep a trnh bay trong
Chng 3 e sap xep d lieu trong danh sach lien ket n. ay chung ta ch trnh
bay s van dung thuat toan tron t nhien e sap xep.
Cung can lu y rang oi vi thao tac hoan v hai phan t th chung ta co the hoan v
hoan toan hai nut hoac ch hoan v phan d lieu. Tuy nhien viec hoan v hoan toan
hai nut se phc tap hn.
B1: IF (SLL_Split(SLList, TempList) = NULL)
Thc hien Bkt
B2: SLL_Merge(SLList, TempList, SLList)
B3: Lap lai B1
Bkt: Ket thuc
- Cai at:
Ham SLL_Natural_Merge_Sort co prototype:
void SLL_Natural_Merge_Sort (SLL_Type &SList);
Ham thc hien viec sap xep thanh phan d lieu cua cac nut trong danh sach SList
theo th t tang da tren thuat toan tron t nhien va trnh bay.
void SLL_Natural_Merge_Sort (SLL_Type &SList)
{ SLL_Type TempList = NULL, List = NULL;
while (SLL_Split(SList, TempList) != NULL)
{ SLL_Merge(SList, TempList, List);
SList = List;
}
return ;
}
h. Sao chep mot danh sach:

Thc chat thao tac nay la chung ta tao mi danh sach NewList bang cach duyet qua
cac nut cua SLList e lay thanh phan d lieu roi tao thanh mot nut mi va bo sung
nut mi nay vao cuoi danh sach NewList.
- Thuat toan:
B1: NewList = NULL
Thc hien Bkt
B4: SLL_Add_Last(NewList, CurNode->Key)
B6: Lap lai B3
Bkt: Ket thuc
Trang: 110
Ham SLL_Copy co prototype:
SLL_Type SLL_Copy (SLL_Type SList, SLL_Type &NewList);
Ham thc hien viec sao chep noi dung danh sach SList thanh danh sach NewList
co cung noi dung thanh phan d lieu theo th t cua cac nut trong SList. Ham tra
ve a ch nut au trong danh sach mi neu viec sao chep thanh cong, ngc lai
ham tra ve con tro NULL.
SLL_Type SLL_Copy (SLL_Type SList, SLL_Type &NewList)
{ NewList = NULL;
SLL_Type CurNode = SList;
{ SLL_Type NewNode = SLL_Add_Last(NewList, CurNode->Key);
{ SLL_Delelte(NewList);
break;
}
}
return (NewList);
}
4.4.3. Danh sach lien ket kep (Doubly Linked List)
A. Cau truc d lieu:

Neu nh vung lien ket cua danh sach lien ket n co 01 moi lien ket vi 01 phan t
khac trong danh sach th vung lien ket trong danh sach lien oi co 02 moi lien ket
vi 02 phan t khac trong danh sach, cau truc d lieu cua moi nut trong danh sach
lien ket oi nh sau:
typedef struct DLL_Node
{ T Key;
InfoType Info;
DLL_Node * NextNode; // Vung lien ket quan ly a ch phan t ke tiep no
DLL_Node * PreNode; // Vung lien ket quan ly a ch phan t trc no
} DLL_OneNode;
ay chung ta cung gia thiet rang vung d lieu cua moi phan t trong danh sach
lien ket oi ch bao gom mot thanh phan khoa nhan dien (Key) cho phan t o. Do
vay, cau truc d lieu tren co the viet lai n gian nh sau:
{ T Key;
DLL_Node * NextNode; // Vung lien ket quan ly a ch phan t ke tiep no
DLL_Node * PreNode; // Vung lien ket quan ly a ch phan t trc no
} DLL_OneNode;
typedef DLL_OneNode * DLL_Type;
Co nhieu phng phap khac nhau e quan ly cac danh sach lien ket oi va tng
ng vi cac phng phap nay se co cac cau truc d lieu khac nhau, cu the:
Trang: 111
- Quan ly a ch phan t au danh sach:
Cach nay hoan toan tng t nh oi vi danh sach lien ket n.
DLL_Type DLL_List1;
Hnh anh minh hoa:
DLL_List1 NULL
15 10 20 18 40 30
NULL
- Quan ly a ch phan t au va cuoi danh sach:

typedef struct DLL_PairNode
{ DLL_Type DLL_First;
DLL_Type DLL_Last;
} DLLP_Type;
DLLP_Type DLL_List2;
Hnh anh minh hoa:
DLL_List2
DLL_First DLL_Last
NULL
15 10 20 18 40 30
NULL
- Quan ly a ch phan t au, a ch phan t cuoi va so phan t trong danh sach:

typedef struct DLL_PairNNode
{ DLL_Type DLL_First;
DLL_Type DLL_Last;
unsigned NumNode;
} DLLPN_Type;
DLLPN_Type DLL_List3;
Hnh anh minh hoa:
DLL_List3
DLL_First NumNode=6 DLL_Last
NULL
15 10 20 18 40 30
NULL
B. Cac thao tac tren danh sach lien ket oi:

Cung nh trong phan danh sach lien ket n, cac thao tac tng ng vi moi cach
quan ly khac nhau cua danh sach lien ket oi co s khac nhau ve mat chi tiet song
noi dung c ban t co s khac nhau. Do vay, ay chung ta ch trnh bay cac thao
tac theo cach quan ly th hai (quan ly cac a ch cua hai nut au va cuoi danh sach
lien ket oi), cac thao tac nay tren cac cach quan ly khac sinh vien t van dung e
ieu chnh cho thch hp.
Trang: 112
Trong thao tac nay ch n gian la chung ta cho gia tr cac con tro quan ly a ch
hai nut au va cuoi danh sach lien ket oi ve con tro NULL. Ham khi tao danh sach
lien ket oi nh sau:
DLLP_Type DLL_Initialize(DLLP_Type &DList)
{ DList.DLL_First = NULL;
DList.DLL_Last = NULL;
return (DList);
}
Hnh anh minh hoa:
DList
NULL DLL_First DLL_Last NULL
b. Tao mi mot phan t / nut:

Gia s chung ta can tao mi mot phan t co thanh phan d lieu la NewData.
- Thuat toan:
B1: DNode = new DLL_OneNode
B2: IF (DNode = NULL)
Thc hien Bkt
B3: DNode->NextNode = NULL
B4: DNode->PreNode = NULL
B5: DNode->Key = NewData
Bkt: Ket thuc
Ham DLL_Create_Node co prototype: DLL_Type DLL_Create_Node(T NewData);
NULL.
DLL_Type DLL_Create_Node(T NewData)
{ DLL_Type Pnode = new DLL_OneNode;
if (Pnode != NULL)
{ Pnode->NextNode = NULL;
Pnode->PreNode = NULL;
Pnode->Key = NewData;
}
return (Pnode);
}
Trang: 113
Pnode = new DLL_OneNode
Pnode
Pnode->NextNode = NULL
Pnode->PreNode = NULL
Pnode->Key = NewData
Pnode NULL
20
NULL

Gia s chung ta can them mot phan t co gia tr thanh phan d lieu la NewData vao
trong danh sach. Viec them co the dien ra au, cuoi hay gia danh sach lien ket.
Do vay, ay chung ta trnh bay 3 thao tac them rieng biet nhau:
- Thuat toan them phan t vao au danh sach lien ket oi:
B1: NewNode = DLL_Create_Node (NewData)
Thc hien Bkt
B3: IF (DLL_List.DLL_First = NULL) // Danh sach rong
B3.1: DLL_List.DLL_First = NewNode
B3.2: DLL_List.DLL_Last = NewNode
B3.3: Thc hien Bkt
B4: NewNode->NextNode = DLL_List.DLL_First // Noi DLL_First vao
B5: DLL_List.DLL_First->PreNode = NewNode // sau NewNode
// Chuyen vai tro ng au cua NewNode cho DLL_First
B6: DLL_List.DLL_First = NewNode
Bkt: Ket thuc
NewNode NULL
27
NULL
DLL_List
DLL_First DLL_Last
NULL
16 20 18 40 30
NULL
NewNode->NextNode = DLL_List.DLL_First:
Trang: 114
NewNode
27
NULL
DLL_List
DLL_First DLL_Last
NULL
16 20 18 40 30
NULL
DLL_List.DLL_First->PreNode = NewNode:
NewNode
27
NULL
DLL_List
DLL_First DLL_Last
NULL
16 20 18 40 30
DLL_List.DLL_First = NewNode:
NewNode
27
NULL
DLL_List
DLL_First DLL_Last
NULL
16 20 18 40 30

DLL_List
DLL_First DLL_Last
NULL
27 16 20 18 40 30
NULL
- Thuat toan them phan t vao cuoi danh sach lien ket oi:
Thc hien Bkt
B3: IF (DLL_List.DLL_First = NULL) // Danh sach rong
Trang: 115
B3.1: DLL_List.DLL_First = NewNode
B3.2: DLL_List.DLL_Last = NewNode
B3.3: Thc hien Bkt
B4: DLL_List.DLL_Last->NextNode = NewNode // Noi NewNode vao
B5: NewNode->PreNode = DLL_List.DLL_Last // sau DLL_Last
// Chuyen vai tro ng cuoi cua NewNode cho DLL_Last
B6: DLL_List.DLL_Last = NewNode
Bkt: Ket thuc
NewNode NULL
25
NULL
DLL_List
DLL_First DLL_Last
NULL
16 20 18 40 30
NULL
DLL_List.DLL_Last->NextNode = NewNode:
NewNode NULL
25
NULL
DLL_List
DLL_First DLL_Last
16 20 18 40 30
NULL
NewNode->PreNode = DLL_List.DLL_Last
NewNode NULL
25
DLL_List
DLL_First DLL_Last
16 20 18 40 30
NULL
Trang: 116
DLL_List.DLL_Last = NewNode:
NewNode NULL
25
DLL_List
DLL_First DLL_Last
16 20 18 40 30
NULL

DLL_List
DLL_First DLL_Last
NULL
16 20 18 40 30 25
NULL
- Thuat toan them phan t vao gia danh sach lien ket oi:
Gia s chung ta can them mot phan t co gia tr thanh phan d lieu la NewData
vao trong danh sach DLL_List vao ngay sau nut co a ch InsNode. Trong thc te
nhieu khi chung ta phai thc hien thao tac tm kiem e xac nh a ch InsNode,
ay gia s chung ta a xac nh c a ch nay.
B1: IF (InsNode->NextNode = NULL) // Them vao cuoi DSLK
B1.1: DLL_Add_Last (DLL_List, NewData)
B1.2: Thc hien Bkt
Thc hien Bkt
// Noi cac nut ke sau InsNode vao sau NewNode
B4: NewNode->NextNode = InsNode->NextNode
B5: InsNode->NextNode->PreNode = NewNode
// Chuyen moi lien ket gia InsNode vi nut ke cua no ve NewNode
B6: InsNode->NextNode = NewNode
B7: NewNode->PreNode = InsNode
Bkt: Ket thuc
Gia s chung ta can them nut co thanh phan d lieu la 25 vao sau nut co a ch
InsNode nh sau: NewData = 25
Trang: 117
DLL_List
DLL_First DLL_Last
InsNode NULL
16 20 18 40 30
NULL
NewNode NULL
25
NULL
NewNode->NextNode = InsNode->NextNode:
DLL_List
DLL_First DLL_Last
InsNode NULL
16 20 18 40 30
NULL
NewNode
25
NULL
InsNode->NextNode->PreNode = NewNode:
DLL_List
DLL_First DLL_Last
InsNode NULL
16 20 18 40 30
NULL
NewNode
25
NULL
InsNode->NextNode = NewNode:
DLL_List
DLL_First DLL_Last
InsNode NULL
16 20 18 40 30
NULL
NewNode
25
NULL
NewNode->PreNode = InsNode
Trang: 118
DLL_List
DLL_First DLL_Last
InsNode NULL
16 20 18 40 30
NULL
NewNode
25
DLL_List
DLL_First DLL_Last
NULL
16 20 18 25 40 30
NULL

Cac ham them phan t tng ng vi cac trng hp co prototype nh sau:
DLL_Type DLL_Add_First(DLLP_Type &DList, T NewData);
DLL_Type DLL_Add_Last(DLLP_Type &DList, T NewData);
DLL_Type DLL_Add_Mid(DLLP_Type &DList, T NewData, DLL_Type &InsNode);
Ham thc hien viec chen phan t co gia tr thanh phan d lieu NewData vao trong
danh sach lien ket oi quan ly bi hai con tro au va cuoi danh sach trong DList
tng ng vi 3 trng hp: Them au, them cuoi, them gia. Cac ham tra ve gia
tr la mot a ch cua nut va mi them neu viec them thanh cong. Trong trng
hp ngc lai, cac ham tra ve con tro NULL.
Rieng oi vi trng hp them gia, ham DLL_Add_Mid thc hien viec them vao
ngay sau nut co a ch InsNode. Noi dung cua cac ham nh sau:
DLL_Type DLL_Add_First(DLLP_Type &DList, T NewData)
{ DLL_Type NewNode = DLL_Create_Node(NewData);
return (NULL);
if (DList.DLL_First == NULL)
DList.DLL_First = DList.DLL_Last = NewNode;
else
{ NewNode->NextNode = DList.DLL_First;
DList.DLL_First->PreNode = NewNode;
DList.DLL_First = NewNode;
}
return (NewNode);
}
//=================================================================
DLL_Type DLL_Add_Last(DLLP_Type &DList, T NewData)
Trang: 119
return (NULL);
if (DList.DLL_Last == NULL)
DList.DLL_First = DList.DLL_Last = NewNode;
else
{ DList.DLL_Last->NextNode = NewNode;
NewNode->PreNode = DList.DLL_Last;
DList.DLL_Last = NewNode;
}
return (NewNode);
}
//=================================================================
DLL_Type DLL_Add_Mid(DLLP_Type &DList, T NewData, DLL_Type &InsNode)
return (NULL);
if (InsNode->NextNode == NULL)
{ InsNode->NextNode = NewNode;
NewNode->PreNode = InsNode;
DList.DLL_Last = NewNode;
}
else
{ NewNode->NextNode = InsNode->NextNode;
InsNode->NextNode->PreNode = NewNode;
InsNode->NextNode = NewNode;
NewNode->PreNode = InsNode;
}
return (NewNode);
}
d. Duyet qua cac nut trong danh sach:

Thao tac nay nham nhieu muc ch, ay n gian chung ta ch duyet e xem noi
dung thanh phan d lieu trong danh sach. Thuat toan nay hoan toan tng t nh
trong danh sach lien ket n.
- Thuat toan:
B1: CurNode = DLL_List.First
Thc hien Bkt
B3: OutputData(CurNode->Key) // Xuat gia tr thanh phan d lieu trong 1 nut
B5: Lap lai B2
Bkt: Ket thuc
Ham DLL_Travelling co prototype:
Trang: 120
void DLL_Travelling(DLLP_Type DList);
Ham duyet qua cac nut trong danh sach lien ket oi quan ly bi hai a ch nut
au tien va nut cuoi cung thong qua DList e xem noi dung thanh phan d lieu
cua moi nut.
void DLL_Travelling (DLLP_Type DList)
{ DLL_Type CurNode = DList.DLL_First;
{ OutputData(CurNode->Key);
}
return;
}
Lu y:
Ham OutputData thc hien viec xuat noi dung cua mot bien co kieu d lieu T. Tuy
vao tng trng hp cu the ma chung ta viet ham OutputData cho phu hp.
e. Tm kiem mot phan t trong danh sach:

Gia s chung ta can tm kiem xem trong danh sach lien ket oi co ton tai nut co
thanh phan d lieu la SearchData hay khong. Thao tac nay chung ta van dung thuat
toan tm tuyen tnh e tm kiem.
- Thuat toan:
B1: CurNode = DLL_List.DLL_First
B2: IF (CurNode = NULL OR CurNode->Key = SearchData)
Thc hien Bkt
B4: Lap lai B2
Bkt: Ket thuc
Ham DLL_Searching co prototype:
DLL_Type DLL_Searching(DLLP_Type DList, T SearchData);
Ham thc hien viec tm kiem nut co thanh phan d lieu la SearchData tren danh
sach lien ket oi quan ly bi hai a ch nut au tien va nut cuoi cung thong qua
DList. Ham tra ve a ch cua nut au tien trong danh sach c tm thay, ngc
lai ham tra ve con tro NULL.
DLL_Type DLL_Searching(DLLP_Type DList, T SearchData)
{ DLL_Type CurNode = DList.DLL_First;
{ if (CurNode->Key == SearchData)
break;
}
Trang: 121
return (CurNode);
}
f. Loai bo bt mot phan t ra khoi danh sach:

Gia s chung ta can loai bo phan t co gia tr thanh phan d lieu la DelData trong
danh sach lien ket oi, e thc hien ieu nay trc tien chung ta phai thc hien thao
tac tm kiem a ch cua nut co thanh phan d lieu la DelData, sau o mi thc hien
thao tac loai bo neu tm thay.
- Thuat toan:
// Tm kiem nut co Key la DelData trong danh sach
B1: DelNode = DLL_Searching(DLL_List, DelData)
Thc hien Bkt
// Loai bo nut tai a ch DelNode ra khoi danh sach
B3: IF (DelNode->PreNode = NULL AND DelNode->NextNode = NULL)
B3.1: DLL_List.DLL_First = DLL_List.DLL_Last = NULL
B3.2: Thc hien B8
B4: IF (DelNode->PreNode = NULL) // Loai bo nut au tien trong danh sach
B4.1: DLL_List.DLL_First = DLL_List.DLL_First->NextNode
B4.2: DLL_List.DLL_First->PreNode = NULL
B4.3: Thc hien B8
B5: IF (DelNode->NextNode = NULL) // Loai bo nut cuoi cung trong danh sach
B5.1: DLL_List.DLL_Last = DLL_List.DLL_Last->PreNode
B5.2: DLL_List.DLL_Last->NextNode = NULL
B5.3: Thc hien B8
// Lien ket cac not trc va sau DelNode vi nhau
B6: DelNode->PreNode->NextNode = DelNode->NextNode
B7: DelNode->NextNode->PreNode = DelNode->PreNode
//Bo moi lien ket gia DelNode vi hai nut trc va sau no, va huy DelNode
B8: DelNode->NextNode = DelNode->PreNode = NULL
B9: delete DelNode
Bkt: Ket thuc
Ham DLL_Delete_Node co prototype:
int DLL_Delete_Node (DLLP_Type &DList, T DelData);
Ham thc hien viec xoa phan t co thanh phan d lieu la DelData trong danh sach
lien ket oi quan ly bi hai con tro au va cuoi ghi nhan trong DList. Ham tra ve
gia tr 1 neu viec xoa thanh cong va ngc lai, ham tra ve gia tr -1. Noi dung cua
ham nh sau:
int DLL_Delete_Node (DLLP_Type &DList, T DelData)
{ DLL_Type DelNode = DLL_Searching(DList, DelData);
if (DelNode == NULL)
return (-1);
Trang: 122
if (DelNode->NextNode == NULL && DelNode->PreNode == NULL)
DList.DLL_First = DList.DLL_Last = NULL;
else
if (DelNode->PreNode == NULL)
{ DList.DLL_First = DList.DLL_First->NextNode;
DList.DLL_First->PreNode = NULL;
}
else
if (DelNode->NextNode == NULL)
{ DList.DLL_Last = DList.DLL_Last->PreNode;
DList.DLL_Last->NextNode = NULL;
}
else
{ DelNode->PreNode->NextNode = DelNode->NextNode;
DelNode->NextNode->PreNode = DelNode->PreNode;
}
DelNode->NextNode = DelNode->PreNode = NULL;
delete DelNode;
return (1);
}
+ Huy nut au: DelData = 16
DLL_List
DLL_First DLL_Last
DelNode NULL
16 20 18 25 40 30
NULL
DLL_List.DLL_First = DLL_List.DLL_First->NextNode
DLL_List
DLL_First DLL_Last
DelNode NULL
16 20 18 25 40 30
NULL
DLL_List.DLL_First->PreNode = NULL
DLL_List
DLL_First DLL_Last
DelNode NULL
16 20 18 25 40 30
NULL NULL
DelNode->NextNode = DelNode->PreNode = NULL;
Trang: 123
DLL_List
DLL_First DLL_Last
DelNode NULL NULL
16 20 18 25 40 30
NULL NULL

DLL_List
DLL_First DLL_Last
NULL
20 18 25 40 30
NULL
+ Huy nut cuoi: DelData = 30

DLL_List
DLL_First DLL_Last
DelNode NULL
16 20 18 25 40 30
NULL
DLL_List.DLL_Last = DLL_List.DLL_Last->PreNode
DLL_List
DLL_First DLL_Last
DelNode NULL
16 20 18 25 40 30
NULL
DLL_List.DLL_Last->NextNode = NULL
DLL_List
DLL_First DLL_Last NULL
DelNode NULL
16 20 18 25 40 30
NULL
DelNode->NextNode = DelNode->PreNode = NULL

DLL_List
DLL_First DLL_Last NULL
DelNode NULL
16 20 18 25 40 30
NULL NULL
Trang: 124
DLL_List
DLL_First DLL_Last
NULL
16 20 18 25 40
NULL
+ Huy nut gia: Gia s chung ta can huy nut co thanh phan d lieu la 18 (DelData = 18)
DLL_List
DLL_First DLL_Last
DelNode NULL
16 20 18 25 40 30
NULL
DelNode->PreNode->NextNode = DelNode->NextNode
DLL_List
DLL_First DLL_Last
NULL
16 20 18 25 40 30
NULL DelNode
DelNode->NextNode->PreNode = DelNode->PreNode
DLL_List
DLL_First DLL_Last
NULL
16 20 18 25 40 30
NULL DelNode
DelNode->NextNode = DelNode->PreNode = NULL

DLL_List
DLL_First DLL_Last
NULL NULL NULL
16 20 18 25 40 30
NULL DelNode

DLL_List
DLL_First DLL_Last
NULL
16 20 25 40 30
NULL
Trang: 125
g. Huy toan bo danh sach:
ay, chung ta thc hien nhieu lan thao tac huy mot nut.
- Thuat toan:
B1: IF (DLL_List.DLL_First = NULL)
Thc hien Bkt
B2: TempNode = DLL_List.DLL_First
B3: DLL_List.DLL_First = DLL_List.DLL_First->NextNode
B4: IF (DLL_List.DLL_First = NULL)
B4.1: DLL_List.DLL_Last = NULL
B4.2: Thc hien B7
B5: DLL_List.DLL_First->PreNode = NULL
B7: delete TempNode
B8: Lap lai B1
Bkt: Ket thuc
Ham DLL_Delete co prototype:
void DLL_Delete (DLLP_Type &DList);
Ham thc hien viec huy toan bo danh sach lien ket oi DList.
void DLL_Delete (DLLP_Type &DList)
{ DLL_Type TempNode = DList.DLL_First;
while (TempNode != NULL)
{ DList.DLL_First = DList.DLL_First->NextNode;
if (DList.DLL_First != NULL)
DList.DLL_First->PreNode = NULL;
delete TempNode;
TempNode = DList.DLL_First;
}
return ;
}
Lu y:
Chung ta cung co the van dung ham DLL_Delete_Node e thc hien thao tac nay,
luc o ham DLL_Delete co the viet lai nh sau:
void DLL_Delete (DLLP_Type &DList)
{ DLL_Type TempNode = DList.DLL_First;
while (TempNode != NULL)
{ DLL_Delete_Node(DList, TempNode->Key);
TempNode = DList.DLL_First;
}
return ;
}
Trang: 126
h. Tao mi danh sach/ Nhap danh sach:
Cung tng t nh trong danh sach lien ket n trong thao tac nay, chung ta lien tuc
thc hien thao tac them mot phan t vao danh sach ma ban au danh sach nay la
mot danh sach rong (Gom hai con tro NULL). Chung ta cung co the s dung mot
trong ba ham them phan t e them phan t, ay s dung ham SLL_Add_Last.
Gia s chung ta can tao danh sach lien ket oi co N phan t.
- Thuat toan:
B1: DLL_Initialize(DLL_List)
B2: i = 1
B3: IF (i > N)
Thc hien Bkt
B4: NewData = InputNewData() // Nhap gia tr cho bien NewData
B5: DLL_Add_Last(DLL_List, NewData)
B6: i++
B7: Lap lai B3
Bkt: Ket thuc
Ham DLL_Create co prototype:
DLLP_Type DLL_Create (DLLP_Type &DList, int N);
Ham tao danh sach lien ket oi co N nut quan ly bi hai a ch nut au tien va
nut cuoi cung thong qua DList. Ham tra ve gia tr ghi nhan hai a ch cua nut au
tien va nut cuoi cung trong danh sach neu viec tao thanh cong, ngc lai ham tra
ve danh sach rong (ca hai a ch eu la gia tr NULL).
DLLP_Type DLL_Create(DLLP_Type &DList, int N)
{ DLL_Initialize(DList);
T NewData;
for (int i = 0; i < N; i++)
{ NewData = InputNewData();
if (DLL_Add_Last(DList, NewData) == NULL)
{ DLL_Delete(DList);
break;
}
}
return (DList);
}
Lu y:
Ham InputNewData thc hien nhap vao noi dung cua mot bien co kieu d lieu T
va tra ve gia tr mi nhap vao. Tuy vao tng trng hp cu the ma chung ta viet
ham InputNewData cho phu hp.
Trang: 127
i. Tach mot danh sach thanh nhieu danh sach:
Gia s chung ta can thc hien viec tach cac nut trong danh sach lien ket oi
DLL_List thanh hai danh sach lien ket oi con DLL_List1 va DLL_List2 luan phien
theo cac ng chay t nhien va can gi lai danh sach lien ket ban au.
- Thuat toan:
B1: DLL_Initialize(DLL_List1)
B2: DLL_Initialize(DLL_List2)
// Cat cac nut t 1 ng chay t nhien ve DLL_List1
Thc hien Bkt
B5: DLL_Add_Last(DLL_List1, CurNode->Key)
Thc hien Bkt
B8: IF (CurNode->PreNode->Key > CurNode->Key)
Thc hien B10
B9: Lap lai B4
// Cat cac nut t 1 ng chay t nhien ve DLL_List2
Thc hien Bkt
B11: DLL_Add_Last(DLL_List2, CurNode->Key)
Thc hien Bkt
B14: IF (CurNode->PreNode->Key > CurNode->Key)
Thc hien B4
B15: Lap lai B10
Bkt: Ket thuc
Ham DLL_Split co prototype:
void DLL_Split(DLLP_Type &DList, DLLP_Type &DList1, DLLP_Type &DList2);
Ham thc hien viec phan phoi cac ng chay t nhien trong DList thanh ve hai
danh sach mi DList1 va DList2 (Danh sach cu DList van c gi nguyen).
void DLL_Split(DLLP_Type &DList, DLLP_Type &DList1, DLLP_Type &DList2)
{ DLL_Initialize(DList1);
DLL_Initialize(DList2);
DLL_Type CurNode = DList.DLL_First;
{ do { if (DLL_Add_Last(DList1, CurNode->Key) == NULL)
{ DLL_Delete (DList1);
DLL_Delete (DList2);
Trang: 128
break;
}
break;
if (CurNode->Key < CurNode->PreNode->Key)
break;
}
while (1);
break;
do { if (DLL_Add_Last(DList2, CurNode->Key) == NULL)
{ DLL_Delete (DList1);
DLL_Delete (DList2);
break;
}
break;
if (CurNode->Key < CurNode->PreNode->Key)
break;
}
while (1);
}
return ;
}
j. Nhap nhieu danh sach thanh mot danh sach:

Chung ta thc hien thao tac nay trong hai trng hp:
+ Tron xen lan cac phan t trong cac danh sach vao thanh mot danh sach theo
mot trat t nhat nh
va sau khi nhap xong van gi lai cac danh sach ban au.
Gia s chung ta can nhap hai danh sach DLL_List1 va DLL_List2 lai vi nhau thanh
mot danh sach DLL_List.
- Thuat toan ghep noi hai danh sach thanh mot danh sach mi:
B1: DLL_Initialize (DLL_List)
// a DLL_List1 vao au DLL_List
B2: CurNode = DLL_List1.DLL_First
Thc hien B7
B4: IF (DLL_Add_Last(DLL_List, CurNode->Key) = NULL)
B4.1: DLL_Delete (DLL_List)
B4.2: Thc hien Bkt
Trang: 129
B6: Lap lai B3
// a DLL_List2 vao sau DLL_List
B7: CurNode = DLL_List2.DLL_First
Thc hien Bkt
B9: IF (DLL_Add_Last(DLL_List, CurNode->Key) = NULL)
B4.2: Thc hien Bkt
B11: Lap lai B8
Bkt: Ket thuc
- Thuat toan tron 2 danh sach thanh 1 danh sach mi theo cac ng chay t nhien:
B1: CurNode1 = DLL_List1.DLL_First
B2: CurNode2 = DLL_List2.DLL_First
B3: IF (CurNode1 = NULL OR CurNode2 = NULL)
Thc hien B6
B4: IF (CurNode1->Key CurNode2->Key)
B4.1: If (DLL_Add_Last (DLL_List, CurNode1->Key) = NULL)
B4.1.1: DLL_Delete(DLL_List)
B4.1.2: Thc hien Bkt
B4.2: CurNode1 = CurNode1->NextNode
B4.3: If (CurNode1 = NULL)
Thc hien B10
B4.4: If (CurNode1->PreNode->Key > CurNode1->Key)
B4.4.1: if (DLL_Add_Last (DLL_List, CurNode2->Key) = NULL)
B4.4.1.1: DLL_Delete(DLL_List)
B4.4.1.2: Thc hien Bkt
B4.4.2: CurNode2 = CurNode2->NextNode
B4.4.3: if (CurNode2 = NULL)
Thc hien B6
B4.4.4: if (CurNode2->PreNode->Key > CurNode2->Key)
Thc hien B3
B4.4.5: Lap lai B4.4.1
B4.5: Lap lai B4
B5: ELSE
B5.1: If (DLL_Add_Last (DLL_List, CurNode2->Key) = NULL)
B5.1.1: DLL_Delete(DLL_List)
B5.2: CurNode2 = CurNode2->NextNode
B5.3: If (CurNode2 = NULL)
Thc hien B6
B5.4: If (CurNode2->PreNode->Key > CurNode2->Key)
B5.4.1: if (DLL_Add_Last (DLL_List, CurNode1->Key) = NULL)
B5.4.1.1: DLL_Delete(DLL_List)
Trang: 130
B5.4.2: CurNode1 = CurNode1->NextNode
B5.4.3: if (CurNode1 = NULL)
Thc hien B10
B5.4.4: if (CurNode1->PreNode->Key > CurNode1->Key)
Thc hien B3
B5.4.5: Lap lai B5.4.1
B5.5: Lap lai B4
// a phan con lai trong DLL_List1 ve DLL_List
B6: IF (CurNode1 = NULL)
Thc hien Bkt
B7: IF (DLL_Add_Last(DLL_List, CurNode1->Key) = NULL)
B7.2: Thc hien Bkt
B8: CurNode1 = CurNode1->NextNode
B9: Lap lai B6
// a phan con lai trong DLL_List2 ve DLL_List
B10: IF (CurNode2 = NULL)
Thc hien Bkt
B11: IF (DLL_Add_Last(DLL_List, CurNode2->Key) = NULL)
B11.2: Thc hien Bkt
B12: CurNode2 = CurNode2->NextNode
B13: Lap lai B10
Bkt: Ket thuc
- Cai at:
Cac ham nhap danh sach co prototype:
DLLP_Type DLL_Concat (DLLP_Type &DList1, DLLP_Type &DList2,
DLLP_Type &DList);
DLLP_Type DLL_Merge (DLLP_Type &DList1, DLLP_Type &DList2,
DLLP_Type &DList);
Ham thc hien viec nhap cac nut trong hai danh sach DList1, DList2 thanh mot
danh sach theo hai trng hp a trnh bay trong hai thuat toan tren ay. Ham tra
ve gia tr cua danh sach sau khi ghep.
DLLP_Type DLL_Concat (DLLP_Type &DList1, DLLP_Type &DList2,
DLLP_Type &DList)
{ DLL_Initialize (DList);
DLL_Type CurNode = DList1.DLL_First;
{ if (DLL_Add_Last (DList, CurNode->Key) == NULL)
return (DList);
}
Trang: 131
}
CurNode = DList2.DLL_First;
{ if (DLL_Add_Last (DList, CurNode->Key) == NULL)
return (DList);
}
}
return (DList);
}
//================================================================
DLLP_Type DLL_Merge (DLLP_Type &DList1, DLLP_Type &DList2,

DLLP_Type &DList)
{ DLL_Type CurNode1 = DList1.DLL_First;
DLL_Type CurNode2 = DList2.DLL_First;
while (CurNode1 != NULL && CurNode2 != NULL)
{ if (CurNode1->Key <= CurNode2->Key)
{ if (DLL_Add_Last (DList, CurNode1->Key) == NULL)
{ DLL_Delete (DList);
return (DList);
}
CurNode1 = CurNode1->NextNode;
if (CurNode1 == NULL)
break;
if (CurNode1->PreNode->Key > CurNode1->Key)
do { if (DLL_Add_Last (DList, CurNode2->Key) == NULL)
return (DList);
}
}
while (CurNode2 != NULL &&
CurNode2->PreNode->Key <= CurNode2->Key);
}
else
return (DList);
}
if (CurNode2 == NULL)
break;
if (CurNode2->PreNode->Key > CurNode2->Key)
do { if (DLL_Add_Last (DList, CurNode1->Key) == NULL)
Trang: 132
return (DList);
}
}
while (CurNode1 != NULL &&
CurNode1->PreNode->Key <= CurNode1->Key);
}
}
while (CurNode1 != NULL)
break;
}
}
while (CurNode2 != NULL)
break;
}
}
return (DList);
}
k. Sap xep th t thanh phan d lieu cac nut trong danh sach:
Thao tac nay rat thuan tien trong viec ap dung thuat toan sap xep tron e sap xep,
sinh vien co the t thc hien. ay, chung ta van dung thuat toan sap xep noi bot
e sap xep d lieu.
- Thuat toan sap xep van dung thuat toan noi bot:
B1: Inode = DLL_List.DLL_First
B2: IF (Inode = NULL)
Thc hien Bkt
B3: IF (Inode = DLL_List.DLL_Last)
Thc hien Bkt
B4: Jnode = DLL_List.DLL_Last
B5: IF (Jnode = Inode)
Thc hien B7
B6: ELSE
B6.1: If (Jnode->Key < Jnode->PreNode->Key)
Swap (Jnode->Key, Jnode->PreNode->Key)
B6.2: Jnode = Jnode->PreNode
B6.3: Lap lai B5
B7: Inode = Inode->NextNode
B8: Lap lai B3
Bkt: Ket thuc
Trang: 133
Ham DLL_Bubble_Sort co prototype:
void DLL_Bubble_Sort (DLLP_Type &DList);
Ham thc hien viec sap xep thanh phan d lieu cua cac nut trong danh sach lien
ket oi DList theo th t tang da tren thuat toan sap xep noi bot.
void DLL_Bubble_Sort (DLLP_Type &DList)
{ DLL_Type Inode = DList.DLL_First;
if (Inode == NULL)
return;
while (Inode != DList.DLL_Last)
{ DLL_Type Jnode = DList.DLL_Last;
while (Jnode != Inode)
{ if (Jnode->Key < Jnode->PreNode->Key)
Swap (Jnode->Key, Jnode->PreNode->Key);
Jnode = Jnode->PreNode;
}
Inode = Inode->NextNode;
}
return ;
}
l. Sao chep mot danh sach thanh mot danh sach mi:
Thao tac nay hoan toan tng t nh trong danh sach lien ket n.
- Thuat toan:
B1: DLL_Initialize(NewList)
Thc hien Bkt
B4: DLL_Add_Last(NewList, CurNode->Key)
B6: Lap lai B3
Bkt: Ket thuc
Ham DLL_Copy co prototype:
DLLP_Type DLL_Copy (DLLP_Type &DList, DLLP_Type &NewList);
Ham thc hien viec sao chep noi dung danh sach DList thanh danh sach NewList
co cung noi dung thanh phan d lieu theo th t cua cac nut tren DList. Ham tra
ve gia tr cua danh sach mi neu viec sao chep thanh cong, ngc lai ham tra ve
gia tr khi tao cua danh sach.
DLLP_Type DLL_Copy (DLLP_Type &DList, DLLP_Type &NewList)
{ DLL_Initialize(NewList);
DLL_Type CurNode = DList.DLL_First;
Trang: 134
{ if (DLL_Add_Last (NewList, CurNode->Key) == NULL)
{ DLL_Detete (NewList);
break;
}
}
return (NewList);
}
4.4.4. u nhc iem cua danh sach lien ket
Do cac phan t (nut) c lu tr khong lien tiep nhau trong bo nh, do vay danh
sach lien ket co cac u nhc iem sau ay:
- Mat o s dung bo nh cua danh sach lien ket khong toi u tuyet oi (<100%);
- Viec truy xuat va tm kiem cac phan t cua danh sach lien ket mat nhieu thi gian
bi luon luon phai duyet tuan t qua cac phan t trong danh sach;
- Tan dung c nhng khong gian bo nh nho e lu tr tng nut, tuy nhien bo nh
lu tr thong tin moi nut lai ton nhieu hn do con phai lu them thong tin ve vung
lien ket. Nh vay neu vung d lieu cua moi nut la ln hn th ty le mc tieu ton bo
nh nay la khong ang ke, ngc lai th no lai gay lang ph bo nh.
- Viec them, bt cac phan t trong danh sach, tach nhap cac danh sach kha de dang
do chung ta ch can thay oi moi lien ket gia cac phan t vi nhau.
4.5. Danh sach han che
Trong cac thao tac tren danh sach khong phai luc nao cung co the thc hien c
tat ca ma nhieu khi cac thao tac nay b han che trong mot so loai danh sach, o la
danh sach han che.
Nh vay, danh sach han che la danh sach ma cac thao tac tren o b han che trong
mot chng mc nao o tuy thuoc vao danh sach. Trong phan nay chung ta xem xet
hai loai danh sach han che chu yeu o la:
- Hang i (Queue);
- Ngan xep (Stack).
4.5.1. Hang i (Queue)
A. Khai niem - Cau truc d lieu:

Hang i la mot danh sach ma trong o thao tac them mot phan t vao trong danh
sach c thc hien mot au nay va thao tac lay ra mot phan t t trong danh
sach lai c thc hien au kia.
Nh vay, cac phan t c a vao trong hang i trc se c lay ra trc, phan
t a vao trong hang i sau se c lay ra sau. Do o ma hang i con c goi
la danh sach vao trc ra trc (FIFO List) va cau truc d lieu nay con c goi la
cau truc FIFO (First In First Out).
Co nhieu cach e bieu dien va to chc cac hang i:
Trang: 135
- S dung danh sach ac,
- S dung danh sach lien ket,
Tuy nhien, ieu quan trong va can thiet la chung ta phai quan ly v tr hai au cua
hang i thong qua hai bien: Bien trc (Front) va Bien sau (Rear). Hai bien nay co
the cung chieu hoac ngc chieu vi th t cac phan t trong mang va trong danh
sach lien ket. ieu nay co ngha la au hang i co the la au mang, au danh sach
lien ket ma cung co the la cuoi mang, cuoi danh sach lien ket. e thuan tien, ay
chung ta gia s au hang i cung la au mang, au danh sach lien ket. Trng hp
ngc lai, sinh vien t ap dung tng t.
ay chung ta se bieu dien va to chc hang i bang danh sach ac va bang danh
sach lien ket n c quan ly bi hai con tro au va cuoi danh sach. Do vay cau
truc d lieu cua hang i cung nh cac thao tac tren hang i se c trnh bay
thanh hai trng hp khac nhau.
- Bieu dien va to chc bang danh sach ac:
typedef struct Q_C
{ int Len; // Chieu dai hang i
int Front, Rear;
T * List; // Noi dung hang i
} C_QUEUE;
C_QUEUE CQ_List;
Hnh anh minh hoa:
CQ_List Front Rear
T 15 10 20 18 40 35 30
Len = 14
- Bieu dien va to chc bang danh sach lien ket n;
typedef struct Q_Element
{ T Key;
Q_Element * Next; // Vung lien ket quan ly a ch phan t ke tiep
} Q_OneElement;
typedef Q_OneElement * Q_Type;
typedef struct QP_Element
{ Q_Type Front;
Q_Type Rear;
} S_QUEUE;
S_QUEUE SQ_List;
Trang: 136
Hnh anh minh hoa:
SQ_List
Front Rear NULL
15 10 20 18 40 35 30
B. Cac thao tac tren hang i to chc bang danh sach ac:
Do han che cua danh sach ac cho nen moi hang i eu co mot chieu dai co nh.
Do vay, trong qua trnh thao tac tren hang i co the xay ra hien tng hang i b
ay hoac hang i b tran.
- Khi hang i b ay: so phan t cua hang i bang chieu dai cho phep cua hang
i. Luc nay chung ta khong the them bat ky mot phan t nao vao hang i.
- Khi hang i b tran: so phan t cua hang i nho hn chieu dai cho phep cua
hang i nhng Rear = Len. Luc nay chung ta phai khac phuc tnh trang tran
hang i bang cach dch tat ca cac phan t cua hang i ra pha trc Front-1
v tr hoac xoay vong e Rear chuyen len v tr au danh sach ac. Trong phan
nay chung ta s dung phng phap xoay vong. Nh vay theo phng phap nay,
hang i b ay trong cac trng hp sau:
+ Front = 1 va Rear = Len, khi: Front < Rear
+ Rear + 1 = Front, khi: Rear < Front
Ghi chu:
Neu chung ta khac phuc hang i b tran bang phng phap dch tat ca cac phan t
cua hang i ra pha trc Front-1 v tr th hang i b ay khi thoa man ieu kien:
Front = 1 va Rear = Len ( ay ta luon luon co: Front Rear).
a. Khi tao hang i (Initialize):

Trong thao tac nay chung ta thc hien viec xac nh kch thc hang i, cap phat
bo nh e lu tr phan d lieu cho hang i, ong thi cho gia tr cac thanh phan
Front, Rear ve gia tr 0 (trong C chung ta khi tao ve gia tr 1).
- Thuat toan:
B1: CQ_List.Len = Length
B2: CQ_List.List = new T[Length]
B3: IF (CQ_List.List = NULL)
Thc hien Bkt
B4: CQ_List.Front = CQ_List.Rear = 0
Bkt: Ket thuc
Ham CQ_Initialize co prototype:
T * CQ_Initialize (C_QUEUE &QList, int Length);
Trang: 137
Ham thc hien viec khi tao gia tr ban au cho hang i quan ly bi QList co
kch thc Length. Ham tra ve con tro tro ti a ch au khoi d lieu cua hang
i neu viec khi tao thanh cong, ngc lai ham tra ve con tro NULL.
T * CQ_Initialize (C_QUEUE &QList, int Length)
{ QList.Len = Length;
QList.List = new T[Length];
if (QList.List == NULL)
return (NULL);
QList.Front = QList.Rear = -1;
return (QList.List);
}
b. Them (a) mot phan t vao hang i (Add):

Trong hang i chung ta luon luon a phan t mi vao cuoi hang i, ngay sau v
tr Rear (neu hang i cha b ay). Gia s chung ta can a phan t co gia tr
NewData vao trong hang i:
- Thuat toan:
// B1+B2: Neu hang i b ay
B1: IF (CQ_List.Front = 1 AND CQ_List.Rear = CQ_List.Len)
Thc hien Bkt
B2: IF (CQ_List.Rear+1 = CQ_List.Front)
Thc hien Bkt
B3: IF (CQ_List.Front = 0) // Neu hang i rong
CQ_List.Front = 1
B4: IF (CQ_List.Rear = CQ_List.Len) //Neu hang b tran
CQ_List.Rear = 1
B5: ELSE
CQ_List.Rear++
B6: CQ_List.List[CQ_List.Rear] = NewData
Bkt: Ket thuc
Ham CQ_Add co prototype:
int CQ_Add (C_QUEUE &QList, T NewData);
Ham thc hien viec them phan t co noi dung NewData vao trong hang i quan
ly bi QList. Ham tra ve v tr cua phan t va mi them neu viec them thanh
cong, ngc lai khi hang i b ay ham tra ve gia tr -1.
int CQ_Add (C_QUEUE &QList, T NewData)
{ if (QList.Front == 0 && QList.Rear == QList.Len-1)
return (-1);
if (QList.Rear+1 == QList.Front)
return (-1);
Trang: 138
if (QList.Front == -1)
QList.Front = 0;
if (QList.Rear == QList.Len)
QList.Rear = 0;
else
QList.Rear += 1;
QList.List[QList.Rear] = NewData;
return (QList.Rear);
}
c. Lay noi dung mot phan t trong hang i ra e x ly (Get):

Trong hang i chung ta luon luon lay noi dung phan t ngay au hang i, tai v
tr Front (neu hang i khong rong). Gia s ta can lay d lieu ra bien Data:
- Thuat toan:
// Neu hang i b rong
B1: IF (CQ_List.Front = 0)
Thc hien Bkt
B2: Data = CQ_List.List[CQ_List.Front]
B3: IF (CQ_List.Rear = CQ_List.Front) // Hang i ch co 1 phan t
B3.1: CQ_List.Rear = CQ_List.Front = 0
B3.2: Thc hien Bkt
B4: IF (CQ_List.Front = CQ_List.Len)
CQ_List.Front = 1
B5: ELSE
CQ_List.Front++
Bkt: Ket thuc
Ham CQ_Get co prototype:
int CQ_Get (C_QUEUE &QList, T &Data);
Ham thc hien viec lay noi dung phan t au hang i quan ly bi QList va ghi
nhan vao Data neu lay c. Ham tra ve gia tr 1 neu viec lay thanh cong, ngc
lai khi hang i b rong ham tra ve gia tr -1.
int CQ_Get (C_QUEUE &QList, T &Data)
{ if (QList.Front == -1)
return (-1);
Data = QList.List[QList.Front];
if (QList.Front == QList.Rear)
{ QList.Front = QList.Rear = -1;
return (1);
}
if (QList.Front == QList.Len-1)
QList.Front = 0;
else
Trang: 139
QList.Front += 1;
return (1);
}
d. Huy hang i:
Trong thao tac nay chung ta thc hien viec huy bo nh a cap phat cho hang i.
Ham CQ_Delete co noi dung nh sau:
void CQ_Delete (C_QUEUE &QList)
{ delete QList.List;
return;
}
C. Cac thao tac tren hang i to chc bang danh lien ket n:
Khac vi hang i bieu dien bang danh sach ac, ay hang i ch b ay khi het
bo nh va khong bao gi b tran.
a. Khi tao hang i (Initialize):

Tng t nh trong danh sach lien ket n, trong thao tac nay chung ta ch n
gian thc hien viec gan cac con tro Front va Rear ve con tro NULL. Ham
SQ_Initialize co noi dung nh sau:
S_QUEUE SQ_Initialize (S_QUEUE &QList)
{ QList.Front = QList.Rear = NULL;
return (QList);
}
b. Them (a) mot phan t vao hang i (Add):

ay chung ta them mot phan t vao sau Rear (Them vao cuoi danh sach lien ket).
Gia s chung ta can a phan t co gia tr d lieu la NewData vao trong hang i:
- Thuat toan:
B1: NewElement = SLL_Create_Node(NewData)
B2: IF (NewElement = NULL)
Thc hien Bkt
B3: IF (SQ_List.Front = NULL) // Neu hang i b rong
B3.1: SQ_List.Front = SQ_List.Rear = NewElement
B3.2: Thc hien Bkt
B4: SQ_List.Rear->Next = NewElement
B5: SQ_List.Rear = NewElement
Bkt: Ket thuc
Ham SQ_Add co prototype:
Q_Type SQ_Add (S_QUEUE &QList, T NewData);
Ham thc hien viec them phan t co noi dung NewData vao trong hang i quan
ly bi QList. Ham tra ve a ch cua phan t va mi them neu viec them thanh
Trang: 140
Q_Type SQ_Add (S_QUEUE &QList, T NewData)
{ Q_Type NewElement = SLL_Create_Node(NewData);
if (NewElement == NULL)
return (NULL);
if (QList.Front == NULL)
QList.Front = QList.Rear = NewElement;
else
{ QList.Rear->Next = NewElement;
QList.Rear = NewElement;
}
return (NewElement);
}
c. Lay noi dung mot phan t trong hang i ra e x ly (Get):

ay chung ta lay noi dung thanh phan d lieu cua phan t a ch Front ra bien
Data va tien hanh huy luon phan t nay.
- Thuat toan:
// Neu hang i b rong
B1: IF (SQ_List.Front = NULL)
Thc hien Bkt
B2: TempElement = SQ_List.Front
B3: SQ_List.Front = SQ_List.Front->Next
B4: TempElement->Next = NULL
B5: Data = TempElement->Key
B6: IF (SQ_List.Front = NULL) // Hang i ch co 1 phan t
SQ_List.Rear = NULL
B7: delete TempElement
Bkt: Ket thuc
Ham SQ_Get co prototype:
int SQ_Get (S_QUEUE &QList, T &Data);
Ham thc hien viec lay noi dung thanh phan d lieu cua phan t au hang i
quan ly bi QList va ghi nhan vao Data neu lay c. Ham tra ve gia tr 1 neu
viec lay thanh cong, ngc lai khi hang i b rong ham tra ve gia tr -1.
int SQ_Get (S_QUEUE &QList, T &Data)
{ if (QList.Front == NULL)
return (-1);
Q_Type TempElement = QList.Front;
QList.Front = QList.Front->Next;
TempElement->Next = NULL;
Data = TempElement->Key;
if (QList.Front == NULL)
Trang: 141
QList.Rear = NULL;
delete TempElement;
return (1);
}
d. Huy hang i:
Trong thao tac nay chung ta thc hien viec huy toan bo cac phan t trong hang i.
Ham SQ_Delete co noi dung nh sau:
void SQ_Delete (S_QUEUE &QList)
{ QList.Rear = NULL;
while (QList.Front != NULL)
{ Q_Type TempElement = QList.Front;
QList.Front = QList.Front->Next;
delete TempElement;
}
return;
}
4.5.2. Ngan xep (Stack)
A. Khai niem - Cau truc d lieu:

Ngan xep la mot danh sach ma trong o thao tac them mot phan t vao trong danh
va thao tac lay ra mot phan t t trong danh sach c thc hien cung mot au.
Nh vay, cac phan t c a vao trong ngan xep sau cung se c lay ra trc
tien, phan t a vao trong hang i trc tien se c lay ra sau cung. Do o ma
ngan xep con c goi la danh sach vao sau ra trc (LIFO List) va cau truc d lieu
nay con c goi la cau truc LIFO (Last In First Out).
Tng t nh hang i, co nhieu cach e bieu dien va to chc cac ngan xep:
- S dung danh sach ac,
- S dung danh sach lien ket,
Do ay ca hai thao tac them vao va lay ra eu c thc hien mot au nen
chung ta ch can quan ly v tr au cua danh sach dung lam mat cho ngan xep thong
qua bien ch so be mat SP (Stack Pointer). Ch so nay co the la cung chieu (au)
hoac ngc chieu (cuoi) vi th t cac phan t trong mang va trong danh sach lien
ket. ieu nay co ngha la be mat ngan xep co the la au mang, au danh sach lien
ket ma cung co the la cuoi mang, cuoi danh sach lien ket. e thuan tien, ay
chung ta gia s be mat cua ngan xep la au mang, au danh sach lien ket. Trng
hp ngc lai, sinh vien t ap dung tng t.
ay chung ta cung se bieu dien va to chc hang i bang danh sach ac va bang
danh sach lien ket n c quan ly bi con tro au danh sach. Do vay cau truc d
lieu cua ngan xep va cac thao tac tren o se c trnh bay thanh hai trng hp
khac nhau.
- Bieu dien va to chc bang danh sach ac:
Trang: 142
typedef struct S_C
{ int Size; // Kch thc ngan xep
int SP;
T * List; // Noi dung ngan xep
} C_STACK;
C_STACK CS_List;
Hnh anh minh hoa:
CS_List SP
T 5 30 10 39 35 26 25 40
Size = 14
- Bieu dien va to chc bang danh sach lien ket n;
typedef struct S_Element
{ T Key;
S_Element * Next; // Vung lien ket quan ly a ch phan t ke tiep
} S_OneElement;
typedef S_OneElement * S_STACK;
S_STACK S_SP;
Hnh anh minh hoa:
S_SP NULL
15 10 20 18 40 35 30
B. Cac thao tac tren ngan xep to chc bang danh sach ac:
Do han che cua danh sach ac cho nen moi ngan xep se co mot kch thc co nh.
Do vay, trong qua trnh thao tac tren ngan xep co the xay ra hien tng ngan xep b
ay. Ngan xep b ay khi so phan t cua ngan xep bang kch thc cho phep cua
ngan xep (SP = 1). Luc nay chung ta khong the them bat ky mot phan t nao vao
trong ngan xep.
a. Khi tao ngan xep (Initialize):

Trong thao tac nay chung ta thc hien viec xac nh kch thc ngan xep, cap phat
bo nh e lu tr phan d lieu cho ngan xep va cho gia tr thanh phan SP ve gia tr
Size+1.
- Thuat toan:
B1: CS_List.Size = MaxSize
B2: CS_List.List = new T[MaxSize]
Trang: 143
B3: IF (CS_List.List = NULL)
Thc hien Bkt
B4: CS_List.SP = CS_List.Size + 1
Bkt: Ket thuc
Ham CS_Initialize co prototype:
T * CS_Initialize (C_STACK &SList, int MaxSize);
Ham thc hien viec khi tao gia tr ban au cho ngan xep quan ly bi SList co
kch thc MaxSize. Ham tra ve con tro tro ti a ch au khoi d lieu cua ngan
xep neu viec khi tao thanh cong, ngc lai ham tra ve con tro NULL.
T * CS_Initialize (C_STACK &SList, int MaxSize)
{ SList.Size = MaxSize;
SList.List = new T[MaxSize];
if (SList.List == NULL)
return (NULL);
SList.SP = SList.Size;
return (SList.List);
}
b. Them (ay) mot phan t vao ngan xep (Push):

Trong ngan xep chung ta luon luon a phan t mi vao tren cung cua ngan xep,
ngay trc v tr SP (neu ngan xep cha b ay). Gia s chung ta can a phan t co
gia tr NewData vao trong ngan xep:
- Thuat toan:
B1: IF (CS_List.SP = 1) // Neu ngan xep b ay
Thc hien Bkt
B2: CS_List.SP--
B3: CS_List.List[CS_List.SP] = NewData
Bkt: Ket thuc
Ham CS_Push co prototype:
int CS_Push (C_STACK &SList, T NewData);
Ham thc hien viec ay them phan t co noi dung NewData vao trong ngan xep
quan ly bi SList. Ham tra ve v tr cua phan t va mi them neu viec them thanh
cong, ngc lai khi ngan xep b ay ham tra ve gia tr -1.
int CS_Push (C_STACK &SList, T NewData)
{ if (SList.SP == 0)
return (-1);
SList.SP -= 1;
SList.List[SList.SP] = NewData;
Trang: 144
return (SList.SP);
}
c. Lay noi dung mot phan t trong ngan xep ra e x ly (Pop):

ay chung ta cung luon luon lay noi dung phan t ngay be mat ngan xep, tai v
tr SP (neu ngan xep khong rong). Gia s ta can lay d lieu ra bien Data:
- Thuat toan:
// Neu ngan xep b rong
B1: IF (CS_List.SP = CS_List.Size+1)
Thc hien Bkt
B2: Data = CS_List.List[CS_List.SP]
B3: CS_List.SP++
Bkt: Ket thuc
Ham CS_Pop co prototype:
int CS_Pop (C_STACK &SList, T &Data);
Ham thc hien viec lay noi dung phan t tren be mat ngan xep quan ly bi SList
va ghi nhan vao Data neu lay c. Ham tra ve gia tr 1 neu viec lay thanh cong,
ngc lai khi ngan xep b rong ham tra ve gia tr -1.
int CS_Pop (C_STACK &SList, T &Data)
{ if (SList.SP == SList.Size)
return (-1);
Data = SList.List[SList.SP];
SList.SP += 1;
return (1);
}
d. Huy ngan xep:

Trong thao tac nay chung ta thc hien viec huy bo nh a cap phat cho ngan xep.
Ham CS_Delete co noi dung nh sau:
void CS_Delete (C_STACK &SList)
{ delete SList.List;
return;
}
C. Cac thao tac tren ngan xep to chc bang danh lien ket n:
a. Khi tao ngan xep:
Ham SS_Initialize co noi dung nh sau:
S_STACK SS_Initialize (S_STACK &SList)
{ SList = NULL;
return (SList);
}
Trang: 145
b. Them (ay) mot phan t vao ngan xep (Push):
ay chung ta them mot phan t vao trc S_SP (Them vao au danh sach lien
ket). Gia s chung ta can a phan t co gia tr d lieu la NewData vao trong ngan
xep:
- Thuat toan:
B1: NewElement = SLL_Create_Node(NewData)
B2: IF (NewElement = NULL)
Thc hien Bkt
B3: IF (S_SP = NULL) // Neu ngan xep b rong
B3.1: S_SP = NewElement
B3.2: Thc hien Bkt
B4: NewElement->Next = S_SP
B5: S_SP = NewElement
Bkt: Ket thuc
Ham SS_Push co prototype:
S_STACK SS_Push (S_STACK &SList, T NewData);
Ham thc hien viec them phan t co noi dung NewData vao trong ngan xep quan
ly bi SList. Ham tra ve a ch cua phan t va mi them neu viec them thanh
S_STACK SS_Push (S_STACK &SList, T NewData)
{ S_STACK NewElement = SLL_Create_Node(NewData);
if (NewElement == NULL)
return (NULL);
NewElement->Next = SList;
SList = NewElement;
return (NewElement);
}
c. Lay noi dung mot phan t trong ngan xep ra e x ly (Pop):

ay chung ta lay noi dung thanh phan d lieu cua phan t a ch S_SP ra bien
Data va tien hanh huy luon phan t nay.
- Thuat toan:
// Neu ngan xep b rong
B1: IF (S_SP = NULL)
Thc hien Bkt
B2: TempElement = S_SP
B3: S_SP = S_SP->Next
B4: TempElement->Next = NULL
B5: Data = TempElement->Key
B6: delete TempElement
Bkt: Ket thuc
Trang: 146
Ham SS_Pop co prototype:
int SS_Pop (S_STACK &SList, T &Data);
Ham thc hien viec lay noi dung thanh phan d lieu cua phan t be mat ngan
xep quan ly bi SList va ghi nhan vao Data neu lay c. Ham tra ve gia tr 1 neu
viec lay thanh cong, ngc lai khi ngan xep b rong ham tra ve gia tr -1.
int SS_Pop (S_STACK &SList, T &Data)
{ if (SList == NULL)
return (-1);
S_STACK TempElement = SList;
SList = SList->Next;
Data = TempElement->Key;
delete TempElement;
return (1);
}
d. Huy ngan xep:

Trong thao tac nay chung ta thc hien viec huy toan bo cac phan t trong ngan xep.
Ham SS_Delete co noi dung nh sau:
void SS_Delete (S_STACK &SList)
{ while (SList != NULL)
{ S_STACK TempElement = SList;
SList = SList->Next;
delete TempElement;
}
return;
}
4.5.3. ng dung cua danh sach han che
Danh sach han che c s dung trong nhieu trng hp, v du:
- Hang i thng c s dung e lu tr cac luong d lieu can x ly tuan t;
- Ngan xep thng c x ly trong cac luong d lieu truy hoi, ac biet la trong viec
kh e quy cho cac thuat toan.
Cau hoi va Bai tap

1. Trnh bay khai niem cua cac loai danh sach? u, nhc iem va ng dung cua moi
loai danh sach?
2. Hay a ra cac cau truc d lieu e quan ly cac loai danh sach va ke tren? Moi loai
ban hay chon ra mot cau truc d lieu ma theo ban la hay nhat? Giai thch s la
chon o?
Trang: 147
3. Trnh bay thuat toan va cai at tat ca cac thao tac tren danh sach lien ket n trong
trng hp quan ly bang con tro au va cuoi trong danh sach?
4. Trnh bay thuat toan va cai at tat ca cac thao tac tren danh sach lien ket oi trong
trng hp ch quan ly bang con tro au trong danh sach?
5. Trnh bay thuat toan va cai at tat ca cac thao tac tren hang i, ngan xep bieu dien
bi danh sach lien ket oi trong hai trng hp: Danh sach lien ket cung chieu va
ngc chieu vi hang i, ngan xep?
6. Van dung cac thuat toan sap xep a hoc, hay cai at cac ham sap xep tren danh
sach lien ket n, lien ket oi theo hai cach quan ly:
- Quan ly a ch nut au danh sach;
- Quan ly a ch nut au va cuoi danh sach.
Theo ban thuat toan sap xep nao de van dung hn tren danh sach lien ket n, lien
ket oi trong hai trng hp nay?
7. Hay trnh bay thuat toan va cai at thao tac tach mot danh sach lien ket (n/oi) co
thanh phan d lieu la cac so nguyen thanh hai danh sach lien ket co thanh phan d
lieu tng ng la cac so chan va cac so le, sao cho toi u bo nh may tnh neu nh
danh sach ban au sau khi tach khong con can thiet?
8. Hay trnh bay thuat toan va cai at thao tac tron cac danh sach lien ket (n/oi) co
th t thanh mot danh sach lien ket co th t sao cho toi u bo nh may tnh neu
nh cac danh sach sau khi tron khong con can thiet?
9. Van dung danh sach lien ket oi, trnh bay thuat toan va cai at cac thao tac tao
mi, them, bt cac muc trong mot menu thanh ngang, menu doc?
10. S dung Stack, viet chng trnh nhap vao mot so nguyen, khong am bat ky, sau
o xuat ra man hnh so ao ngc th t cac ch so cua so nhap vao.
V du: - Nhap vao mot so nguyen: 10245
- So nguyen dang ao ngc: 54201
11. S dung Stack, viet chng trnh chuyen oi mot so nguyen N trong he thap phan
(he 10) sang bieu dien :
a. He nh phan (he 2)
b. He thap luc phan (he 16)
12. Viet chng trnh mo phong cho bai toan Thap Ha noi va Thap Saigon vi cac
cau truc d lieu nh sau:
a. S dung danh sach lien ket e lu tr cac cot thap;
b. S dung Stack e lu tr cac cot cua thap
Co nhan xet g cho tng trng hp?
13. Van dung Stack e g e quy cho thuat toan QuickSort?
14. Van dung danh sach lien ket vong e giai bai toan Josephus.
Trang: 148
Chng 5: CAY (TREE)
5.1. Khai niem Bieu dien cay

5.1.1. nh ngha cay
Cay la mot tap hp cac phan t (cac nut) c to chc va co cac ac iem sau:
- Hoac la mot tap hp rong (cay rong)
- Hoac la mot tap hp khac rong trong o co mot nut duy nhat c lam nut goc
(Roots Node), cac nut con lai c phan thanh cac nhom trong o moi nhom lai la
mot cay goi la cay con (Sub-Tree).
Nh vay, mot cay con co the la mot tap rong cac nut va cung co the la mot tap hp
khac rong trong o co mot nut lam nut goc cay con.
V du: Cay th muc tren mot a cng
\
OS PROGRAMS APPLICATIONS UTILITIES
DOS WINDOWS PASCAL C WORD EXCEL NC NU
BIN BGI BIN INCLUDE BGI DOC PICTURE SHEET
5.1.2. Mot so khai niem lien quan
a. Bac cua mot nut:

Bac cua mot nut (nodes degree) la so cay con cua nut o
V du: Bac cua nut OS trong cay tren bang 2
b. Bac cua mot cay:

Bac cua mot cay (trees degree) la bac ln nhat cua cac nut trong cay.
Cay co bac N goi la cay N-phan (N-Tree)
V du: Bac cua cay tren bang 4 (bang bac cua nut goc) va cay tren goi la cay t
phan (Quartz-Tree)
c. Nut goc:
Nut goc (roots node) la nut khong phai la nut goc cay con cua bat ky mot cay con
nao khac trong cay (nut khong lam nut goc cay con).
Trang: 149
V du: Nut \ cua cay tren la cac nut goc.
d. Nut ket thuc:

Nut ket thuc hay con goi la nut la (leafs node) la nut co bac bang 0 (nut khong co
nut cay con).
V du: Cac nut DOS, WINDOWS, BIN, INCLUDE, BGI, DOC, PICTURE, SHEET, NC,
NU cua cay tren la cac nut la.
e. Nut trung gian:

Nut trung gian hay con goi la nut gia (interiors node) la nut khong phai la nut goc
va cung khong phai la nut ket thuc (nut co bac khac khong va la nut goc cay con
cua mot cay con nao o trong cay).
V du: Cac nut OS, PROGRAMS, APPLICATIONS, UTILITIES, PASCAL, C, WORD,
EXCEL cua cay tren la cac nut trung gian.
f. Mc cua mot nut:

Mc cua mot nut (nodes level) bang mc cua nut goc cay con cha no cong them
1, trong o mc cua nut goc bang 1.
V du: Mc cua cac nut DOS, WINDOWS, PASCAL, C, WORD, EXCEL, NC, NU cua
cay tren bang 3; mc cua cac nut BIN, INCLUDE, BGI, DOC, PICTURE,
SHEET, cua cay tren bang 4.
g. Chieu cao hay chieu sau cua mot cay:

Chieu cao cua mot cay (trees height) hay chieu sau cua mot cay (trees depth) la
mc cao nhat cua cac nut trong cay.
V du: Chieu cao cua cay tren bang 4.
h. Nut trc va nut sau cua mot nut:

Nut T c goi la nut trc (ancestors node) cua nut S neu cay con co goc la T
cha cay con co goc la S. Khi o, nut S c goi la nut sau (descendants node) cua
nut T.
V du: Nut PROGRAMS la nut trc cua cac nut BIN, BGI, INCLUDE, PASCAL, C va
ngc lai cac nut BIN, BGI, INCLUDE, PASCAL, C la nut sau cua nut
PROGRAMS trong cay tren.
i. Nut cha va nut con cua mot nut:

Nut B c goi la nut cha (parents node) cua nut C neu nut B la nut trc cua nut C
va mc cua nut C ln hn mc cua nut B la 1 mc. Khi o, nut C c goi la nut
con (childs node) cua nut B.
V du: Nut PROGRAMS la nut cha cua cac nut PASCAL, C va ngc lai cac nut
PASCAL, C la nut con cua nut PROGRAMS trong cay tren.
j. Chieu dai ng i cua mot nut:

Chieu dai ng i cua mot nut la so nh (so nut) tnh t nut goc e i en nut o.
Trang: 150
Nh vay, chieu dai ng i cua nut goc luon luon bang 1, chieu dai ng i ti
mot nut bang chieu dai ng i ti nut cha no cong them 1.
V du: Chieu dai ng i ti nut PROGRAMS trong cay tren la 2.
k. Chieu dai ng i cua mot cay:

Chieu dai ng i cua mot cay (paths length of the tree) la tong tat ca cac chieu
dai ng i cua tat ca cac nut tren cay.
V du: Chieu dai ng cua cay tren la 65.
Ghi chu: ay la chieu dai ng i trong (internal paths length) cua cay. e co c
chieu dai ng i ngoai (external paths length) cua cay ngi ta m rong tat ca
cac nut cua cay sao cho tat ca cac nut cua cay co cung bac bang cach them vao
cac nut gia sao cho tat ca cac nut co bac bang bac cua cay. Chieu dai ng i
ngoai cua cay bang tong chieu dai cua tat ca cac nut m rong.
l. Rng:
Rng (forest) la tap hp cac cay.
Nh vay, mot cay khi mat nut goc se tr thanh mot rng.
5.1.3. Bieu dien cay
Co nhieu cach e bieu dien cay:

- S dung o th: Nh v du ve cay th muc tren.
- S dung gian o tap hp
- S dung dang phan cap ch so: Nh bang muc luc trong cac tai lieu, giao trnh,
-
Bieu dien cay trong bo nh may tnh:
e bieu dien cay trong bo nh may tnh chung ta co the s dung danh sach lien ket.
Nh vay, e bieu dien cay N-phan chung ta s dung danh sach co N moi lien ket e
quan ly a ch N nut goc cay con. Nh vay cau truc d lieu cua cay N-phan tng
t nh cau truc d lieu cua danh sach a lien ket:
const int N = 100;
typedef struct NT_Node
{ T Key;
NT_Node * SubNode[N]; // Vung lien ket quan ly a ch N nut goc cay con
} NT_OneNode;
typedef NT_OneNode * NT_Type;
e quan ly cac cay chung ta ch can quan ly a ch nut goc cua cay:
NT_Type NTree;
Trong pham vi phan nay chung ta se trnh bay cac thao tac tren cay nh phan
(Binary Tree) la cay pho bien va thong dung nhat.
Trang: 151
5.2. Cay nh phan (Binary Tree)
5.2.1. nh ngha
Cay nh phan la cay co bac bang 2 (bac cua moi nut toi a bang 2).
V du: Cay nh phan bieu dien bieu thc (2 a) + [b : (c 1) + d] nh sau:
ExprTree
2 a : d
NULL NULL NULL NULL b - NULL NULL
NULL NULL c 1
NULL NULL NULL NULL

5.2.2. Bieu dien va Cac thao tac
A. Bieu dien cay nh phan:

e bieu dien cay nh phan trong bo nh may tnh chung ta co the s dung danh sach
co 2 moi lien ket e quan ly a ch cua 2 nut goc cay con (cay con trai va cay con
phai). Nh vay cau truc d lieu cua cay nh phan tng t nh cau truc d lieu cua
danh sach lien ket oi nhng ve cach thc lien ket th khac nhau:
typedef struct BinT_Node
{ T Key;
BinT_Node * BinT_Left; // Vung lien ket quan ly a ch nut goc cay con trai
BinT_Node * BinT_Right; // Vung lien ket quan ly a ch nut goc cay con phai
} BinT_OneNode;
typedef BinT_OneNode * BinT_Type;
e quan ly cac cay nh phan chung ta can quan ly a ch nut goc cua cay:
BinT_Type BinTree;
B. Cac thao tac tren cay nh phan:

a. Khi tao cay nh phan:
Viec khi tao cay nh phan ch n gian chung ta cho con tro quan ly a ch nut goc ve
con tro NULL. Ham khi tao cay nh phan nh sau:
Trang: 152
BinT_Type BinT_Initialize (BinT_Type &BTree)
{ BTree = NULL;
return (BTree);
}
b. Tao mi mot nut:

Thao tac nay hoan toan tng t nh oi vi thao tac tao mi mot nut trong danh
sach lien ket oi. Gia s chung ta can tao mi mot nut co thanh phan d lieu la
NewData.
- Thuat toan:
B1: BTNode = new BinT_OneNode
B2: IF (BTNode = NULL)
Thc hien Bkt
B3: BTNode->BinT_Left = NULL
B4: BTNode->BinT_Right = NULL
B5: BTNode->Key = NewData
Bkt: Ket thuc
Ham BinT_Create_Node co prototype:
BinT_Type BinT_Create_Node(T NewData);
NULL.
BinT_Type BinT_Create_Node(T NewData)
{ BinT_Type BTnode = new BinT_OneNode;
if (BTnode != NULL)
{ BTnode->BinT_Left = NULL;
BTnode->BinT_Right = NULL;
BTnode->Key = NewData;
}
return (BTnode);
}
BTnode = new BinT_OneNode
BTnode
BTnode->BinT_Left = NULL
BTnode->BinT_Right = NULL
Trang: 153
BTnode->Key = NewData
BTnode
30
NULL NULL
c. Them mot nut vao trong cay nh phan:

Gia s chung ta can them mot nut co gia tr thanh phan d lieu la NewData vao
trong cay nh phan. Viec them co the dien ra cay con trai hoac cay con phai cua
cay nh phan. Do vay, ay chung ta trnh bay 2 thao tac them rieng biet nhau:
- Thuat toan them 1 nut vao ben trai nhat cua cay:
B1: NewNode = BinT_Create_Node (NewData)
Thc hien Bkt
B3: IF (BinTree = NULL) // Cay rong
B3.1: BinTree = NewNode
B3.2: Thc hien Bkt
B4: Lnode = BinTree
B5: IF (Lnode->BinT_Left = NULL) // Cay con trai rong
B5.1: Lnode->BinT_Left = NewNode
B5.2: Thc hien Bkt
B6: Lnode = Lnode->BinT_Left // i theo nhanh cay con trai
B7: Lap lai B5
Bkt: Ket thuc
Gia s chung ta can them nut co thanh phan d lieu la 17 vao ben trai nhat cua
cay nh phan: NewData = 17
NewNode BinTree
17 20
NULL NULL Lnode 25 45
19 16 NULL NULL
NULL NULL 30 21
NULL NULL NULL NULL
Trang: 154
B5.1: Lnode->BinT_Left = NewNode
NewNode BinTree
17 20
NULL NULL Lnode 25 45
19 16 NULL NULL
NULL 30 21
NULL NULL NULL NULL

Ket qua sau khi them:
BinTree
20
Lnode 25 45
NewNode 19 16 NULL NULL
17 NULL 30 21
NULL NULL NULL NULL NULL NULL

Ham BinT_Add_Left co prototype:
BinT_Type BinT_Add_Left(BinT_Type &BT_Tree, T NewData);
Ham thc hien viec them vao ben trai nhat trong cay nh phan BT_Tree mot nut
co thanh phan d lieu la NewData, ham tra ve con tro tro ti a ch cua nut mi
them neu viec them thanh cong, ngc lai neu khong u bo nh, ham tra ve con
tro NULL.
BinT_Type BinT_Add_Left(BinT_Type &BT_Tree, T NewData)
{ BinT_Type NewNode = BinT_Create_Node(NewData);
return (NewNode);
if (BT_Tree == NULL)
Trang: 155
BT_Tree = NewNode;
else
{ BinT_Type Lnode = BT_Tree;
while (Lnode->BinT_Left != NULL)
Lnode = Lnode->BinT_Left;
Lnode->BinT_Left = NewNode;
}
return (NewNode);
}
- Thuat toan them 1 nut vao ben phai nhat cua cay nh phan:
B1: NewNode = BinT_Create_Node (NewData)
Thc hien Bkt
B3: IF (BinTree = NULL) // Cay rong
B3.1: BinTree = NewNode
B3.2: Thc hien Bkt
B4: Rnode = BinTree
B5: IF (Rnode->BinT_Right = NULL) // Cay con phai rong
B5.1: Rnode->BinT_Right = NewNode
B5.2: Thc hien Bkt
B6: Rnode = Rnode->BinT_Right // i theo nhanh cay con phai
B7: Lap lai B5
Bkt: Ket thuc
Gia s chung ta can them nut co thanh phan d lieu la 21 vao ben phai nhat cua
cay nh phan: NewData = 21
BinTree NewNode
40 Rnode 21
36 55 NULL NULL
12 18 45 NULL
NULL NULL NULL NULL 10 8
NULL NULL 11 5
NULL NULL NULL NULL
Trang: 156
B5.1: Rnode->BinT_Right = NewNode
BinTree NewNode
40 Rnode 21
36 55 NULL NULL
12 18 45 NULL
NULL NULL NULL NULL 10 8
NULL NULL 11 5
NULL NULL NULL NULL

BinTree
40 Rnode
36 55 NewNode
12 18 45 21
NULL NULL NULL NULL 10 8 NULL NULL
NULL NULL 11 5
NULL NULL NULL NULL

Ham BinT_Add_Right co prototype:
BinT_Type BinT_Add_Right(BinT_Type &BT_Tree, T NewData);
Ham thc hien viec them vao ben phai nhat trong cay nh phan BT_Tree mot nut
co thanh phan d lieu la NewData, ham tra ve con tro tro ti a ch cua nut mi
them neu viec them thanh cong, ngc lai neu khong u bo nh, ham tra ve con
tro NULL.
BinT_Type BinT_Add_Right(BinT_Type &BT_Tree, T NewData)
Trang: 157
{ BinT_Type NewNode = BinT_Create_Node(NewData);
return (NewNode);
if (BT_Tree == NULL)
BT_Tree = NewNode;
else
{ BinT_Type Rnode = BT_Tree;
while (Rnode->BinT_Right != NULL)
Rnode = Rnode->BinT_Right;
Rnode->BinT_Right = NewNode;
}
return (NewNode);
}
d. Duyet qua cac nut tren cay nh phan:

Trong thao tac nay chung ta tm cach duyet qua (ghe tham) tat ca cac nut trong cay
nh phan e thc hien mot thao tac x ly nao o oi vi nut nay (Xem noi dung
thanh phan d lieu chang han). Can c vao th t duyet nut goc so vi 2 nut goc
cay con, thao tac duyet co the thc hien theo mot trong ba th t:
- Duyet theo th t nut goc trc (Preorder):
Theo cach duyet nay th nut goc se c duyet trc sau o mi duyet en hai cay
con. Can c vao th t duyet hai cay con ma chung ta co hai cach duyet theo th t
nut goc trc:
+ Duyet nut goc, duyet cay con trai, duyet cay con phai (Root Left Right)
+ Duyet nut goc, duyet cay con phai, duyet cay con trai (Root Right - Left)
- Duyet theo th t nut goc gia (Inorder):
Theo cach duyet nay th chung ta duyet mot trong hai cay con trc roi en duyet
nut goc va sau o mi duyet cay con con lai. Can c vao th t duyet hai cay con
chung ta cung se co hai cach duyet theo th t nut goc gia:
+ Duyet cay con trai, duyet nut goc, duyet cay con phai (Left Root - Right)
+ Duyet cay con phai, duyet nut goc, duyet cay con trai (Right Root - Left)
- Duyet theo th t nut goc sau (Postorder):
Tng t nh duyet theo nut goc trc, trong cach duyet nay th nut goc se c
duyet sau cung so vi duyet hai nut goc cay con. Do vay, can c vao th t duyet
hai cay con ma chung ta cung co hai cach duyet theo th t nut goc sau:
+ Duyet cay con trai, duyet cay con phai, duyet nut goc (Left Right - Root)
+ Duyet cay con phai, duyet cay con trai, duyet nut goc (Right Left - Root)
Trong phan nay chung ta ch trnh bay mot cach duyet theo mot th t cu the o la:
Duyet cay con trai, duyet nut goc va duyet cay con phai (Left Root Right) va s
dung thuat toan e quy. Cac cach duyet khac bang thuat toan e quy hay khong e
quy sinh vien t van dung tng t.
- Thuat toan e quy e duyet cay nh phan theo th t Left Root Right (LRootR):
B1: CurNode = BinTree
Trang: 158
Thc hien Bkt
B3: LRootR (BinTree->BinT_Left) // Duyet cay con trai
B4: Process (CurNode->Key) // X ly thong tin nut goc
B5: LRootR (BinTree->BinT_Right) // Duyet cay con phai
Bkt: Ket thuc
Gia s chung ta can duyet qua cac nut trong cay nh phan di ay theo th t
Left Root Right:
BinTree
40
36 55
12 18 45 21
NULL NULL NULL NULL 10 8 NULL NULL
NULL NULL 11 5
NULL NULL NULL NULL

LRootR(BinTree->BinT_Left)
LRootR(BinTree->BinT_Left->BinT_Left)
LRootR(NULL)
Process(12)
LRootR(NULL)
Process(36)
LRootR(BinTree->BinT_Left->BinT_Right)
LRootR(NULL)
Process(18)
LRootR(NULL)
Process(40)
LRootR(BinTree->BinT_Right)
LRootR(BinTree->BinT_Right->BinT_Left)
LRootR(BinTree->BinT_Right->BinT_Left->BinT_Left)
LRootR(NULL)
Process(10)
LRootR(NULL)
Trang: 159
Process(45)
LRootR(BinTree->BinT_Right->BinT_Left->BinT_Right)
LRootR(BinTree->BinT_Right->BinT_Left->BinT_Right->BinT_Left)
LRootR(NULL)
Process(11)
LRootR(NULL)
Process(8)
LRootR(BinTree->BinT_Right->BinT_Left->BinT_Right->BinT_Right)
LRootR(NULL)
Process(5)
LRootR(NULL)
Process(55)
LRootR(BinTree->BinT_Right->BinT_Right)
LRootR(NULL)
Process(21)
LRootR(NULL)
Nh vay th t cac thong tin cua cac nut c x ly nh sau:
12 -> 36 -> 18 -> 40 -> 10 -> 45 -> 11 -> 8 -> 5 -> 55 -> 21
Ham BinT_LRootR_Travelling co prototype:
void BinT_LRootR_Travelling(BinT_Type BT_Tree);
Ham thc hien thao tac duyet qua tat ca cac nut trong cay nh phan BT_Tree theo
th t duyet Left Root Right e x ly thong tin moi nut.
void BinT_LRootR_Travelling(BinT_Type BT_Tree)
{ if (BT_Tree == NULL)
return;
BinT_LRootR_Travelling (BT_Tree->BinT_Left);
Process (BT_Tree->Key)
BinT_LRootR_Travelling (BT_Tree->BinT_Right);
return;
}
Lu y:
Ham Process thc hien viec x ly thong tin (Key) cua moi nut. Do vay tuy tng
trng hp cu the ma chung ta viet ham cho phu hp. Chang han e xuat thong
tin th ch can cac lenh xuat d lieu e xuat thanh phan Key.
e. Tnh chieu cao cua cay:

e tnh chieu cao cua cay (TH) chung ta phai tnh chieu cao cua cac cay con, khi o
chieu cao cua cay chnh la chieu cao ln nhat cua cac cay con cong them 1 (chieu
cao nut goc). Nh vay thao tac tnh chieu cao cua cay la thao tac tnh e quy chieu
cao cua cac cay con (chieu cao cua cay con co goc la nut la bang 1).
- Thuat toan:
Trang: 160
B1: IF (BinTree = NULL)
B1.1: TH = 0
B1.2: Thc hien Bkt
B2: THL = TH(BinTree->BinT_Left)
B3: THR = TH(BinTree->BinT_Right)
B4: IF (THL > THR)
TH = THL + 1
B5: ELSE
TH = THR + 1
Bkt: Ket thuc
V du: Chieu cao cua cay nh phan sau bang 4.
BinTree
40
36 55
2 4
12 18 3 45 21
1 1 2 1
0 NULL 0 NULL 0 NULL 0 NULL 0 NULL 8 0 NULL 0 NULL
1
0 NULL 0 NULL

Ham BinT_Height co prototype:
int BinT_Height(BinT_Type BTree);
Ham tnh chieu cao cua cay BTree theo thuat toan e quy. Ham tra ve chieu cao
cua cay can tnh.
int BinT_Height(BinT_Type BTree)
{ if (BTree == NULL)
return (0);
int HTL = BinT_Height(BTree->BinT_Left);
int HTR = BinT_Height(BTree->BinT_Right);
if (HTL > HTR)
return (HTL+1);
return (HTR+1);
}
f. Tnh so nut cua cay:

Tng t nh tnh chieu cao cua cay, so nut cua cay (NN) bang tong so nut cua hai
cay con cong them 1. Do vay thao tac nay chung ta cung se tnh e quy so nut cua
cac cay con (so nut cua cay con co goc la nut la bang 1).
Trang: 161
- Thuat toan:
B1: IF (BinTree = NULL)
B1.1: NN = 0
B1.2: Thc hien Bkt
B2: NNL = NN(BinTree->BinT_Left)
B3: NNR = NN(BinTree->BinT_Right)
B4: NN = NNL + NNR + 1
Bkt: Ket thuc
V du: So nut cua cay nh phan sau bang 8.
BinTree
40
36 55
12 18 45 21
NULL NULL NULL NULL NULL 8 NULL NULL
0 0 0 0 0 0 0
1(0+0+1) 1 (0+0+1) NULL NULL 1 (0+0+1)
3 (1+1+1) 0 0
1 (0+0+1)
2 (0+1+1)
4 (2+1+1)
8 (3+4+1)

Ham BinT_Num_Node co prototype:
int BinT_Num_Node(BinT_Type BTree);
Ham tnh so nut cua cay BTree theo thuat toan e quy. Ham tra ve so nut cua cay
can tnh.
int BinT_Num_Node(BinT_Type BTree)
{ if (BTree == NULL)
return (0);
int NNL = BinT_Num_Node(BTree->BinT_Left);
int NNR = BinT_Num_Node(BTree->BinT_Right);
return (NNL + NNR + 1);
}
g. Huy mot nut tren cay nh phan:

Viec huy mot nut trong cay co the lam cho cay tr thanh rng. Do vay trong thao tac
nay neu chung ta tien hanh huy mot nut la th khong co ieu g xay ra, song neu huy
Trang: 162
nut khong phai la nut la th chung ta phai tm cach chuyen cac nut goc cay con la
cac nut con cua nut can huy thanh cac nut goc cay con cua cac nut khac roi mi
tien hanh huy nut nay.
- Trng hp neu nut can huy ch co 01 nut goc cay con th chung ta co the chuyen
nut goc cay con nay thanh nut goc cay con cua nut cha cua nut can huy.
- Trng hp neu nut can huy co 2 nut goc cay con th chung ta phai chuyen 02
nut goc cay con nay thanh nut goc cay con cua cac nut khac vi nut can huy.
Viec chon cac nut e lam nhiem vu nut cha cua cac nut goc cay con nay tuy vao
tng trng hp cu the cua cay nh phan ma chung ta se la chon cho phu hp.
Do vay, thao tac huy mot nut se c trnh bay cu the trong cac loai cay cu the
c trnh bay cac phan sau.
5.2.3. Cay nh phan tm kiem (Binary Searching Tree)
A. Khai niem Cau truc d lieu:

Cay nh phan tm kiem la cay nh phan co thanh phan khoa cua moi nut ln hn thanh
phan khoa cua tat ca cac nut trong cay con trai cua no va nho hn thanh phan khoa
cua tat ca cac nut trong cay con phai cua no.
V du: Hnh anh sau la hnh anh cua mot cay nh phan tm kiem
BSTree
60
25 65
19 40 NULL NULL
10 NULL 30 44
NULL NULL NULL NULL 50

15
NULL NULL NULL NULL
T khai niem nay chung ta co mot so nhan xet:

- Cau truc d lieu cua cay nh phan tm kiem la cau truc d lieu e bieu dien cac cay
nh phan noi chung.
typedef struct BST_Node
{ T Key;
BST_Node * BST_Left; // Vung lien ket quan ly a ch nut goc cay con trai
BST_Node * BST_Right; // Vung lien ket quan ly a ch nut goc cay con phai
} BST_OneNode;
Trang: 163
typedef BST_OneNode * BST_Type;
e quan ly cac cay nh phan tm kiem chung ta can quan ly a ch nut goc cua cay:
BST_Type BSTree;
- Khoa nhan dien (Key) cua cac nut trong cay nh phan tm kiem oi mot khac nhau
(khong co hien tng trung khoa).
Tuy nhien trong trng hp can quan ly cac nut co khoa trung nhau trong cay nh phan
tm kiem th chung ta co the m rong cau truc d lieu cua moi nut bang cach them
thanh phan Count e ghi nhan so lng cac nut trung khoa. Khi o, cau truc d lieu e
quan ly cac cay nh phan tm kiem c m rong nh sau:
typedef struct BSE_Node
{ T Key;
int Count;
BSE_Node * BSE_Left; // Vung lien ket quan ly a ch nut goc cay con trai
BSE_Node * BSE_Right; // Vung lien ket quan ly a ch nut goc cay con phai
} BSE_OneNode;
typedef BSE_OneNode * BSE_Type;
va chung ta quan ly cay nh phan tm kiem nay bang cach quan ly a ch nut goc:
BSE_Type BSETree;
- Nut ben trai nhat la nut co gia tr khoa nhan dien nho nhat va nut ben phai nhat
la nut co gia tr khoa nhan dien ln nhat trong cay nh phan tm kiem.
- Trong mot cay nh phan tm kiem th t duyet cay Left Root Right la th t duyet
theo s tang dan cac gia tr cua Key trong cac nut va th t duyet cay Right Root
Left la th t duyet theo s giam dan cac gia tr cua Key trong cac nut.
B. Cac thao tac tren cay nh phan tm kiem:

a. Tm kiem tren cay:
Gia s chung ta can tm tren cay nh phan tm kiem xem co ton tai nut co khoa Key
la SearchData hay khong.
e thc hien thao tac nay chung ta se van dung thuat toan tm kiem nh phan: Do
ac iem cua cay nh phan tm kiem th tai mot nut, neu Key cua nut nay khac vi
SearchData th SearchData ch co the tm thay hoac tren cay con trai cua nut nay
neu SearchData nho hn Key cua nut nay hoac tren cay con phai cua nut nay neu
SearchData ln hn Key cua nut nay.
- Thuat toan tm kiem 1 nut tren cay nh phan tm kiem:
B1: CurNode = BSTree
B2: IF (CurNode = NULL) or (CurNode->Key = SearchData)
Thc hien Bkt
B3: IF (CurNode->Key > SearchData) // Tm kiem tren cay con trai
CurNode = CurNode->BST_Left
B4: ELSE // Tm kiem tren cay con phai
CurNode = CurNode->BST_Right
B5: Lap lai B2
Trang: 164
Bkt: Ket thuc
Gia s chung ta can tm kiem nut co thanh phan d lieu la 30 tren cay nh phan
tm kiem sau: SearchData = 30
CurNode BSTree
60
25 65
19 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL
CurNode->Key > SearchData // Tm kiem tren cay con trai

BSTree
CurNode 60
25 65
19 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL
Trang: 165
CurNode->Key < SearchData // Tm kiem tren cay con phai

BSTree
60
25 CurNode 65
19 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL

BSTree
60
25 65
19 CurNode 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL
CurNode->Key = SearchData Thuat toan ket thuc (Tm thay)
Trang: 166
Bay gi gia s chung ta can tm kiem nut co thanh phan d lieu la 35 tren cay nh
phan tm kiem tren: SearchData = 35
CurNode BSTree
60
25 65
19 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL

BSTree
CurNode 60
25 65
19 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL
Trang: 167

BSTree
60
25 CurNode 65
19 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL

BSTree
60
25 65
19 CurNode 40 NULL NULL
10 NULL 30 44

15
NULL NULL NULL NULL

Trang: 168
BSTree
60
25 65
19 40 NULL NULL
10 NULL 30 CurNode 44

15
NULL NULL NULL NULL
CurNode = NULL Thuat toan ket thuc (Khong tm thay)

Ham BST_Searching co prototype:
BST_Type BST_Searching(BST_Type BS_Tree, T SearchData);
Ham thc hien thao tac tm kiem tren cay nh phan tm kiem BS_Tree nut co
thanh phan Key la SearchData. Ham tra ve con tro tro ti a ch cua nut co Key
la SearchData neu tm thay, trong trng hp ngc lai ham tra ve con tro NULL.
BST_Type BST_Searching(BST_Type BS_Tree, T SearchData)
{ BST_Type CurNode = BS_Tree;
while (CurNode != NULL && CurNode->Key != SearchData)
{ if (CurNode->Key > SearchData)
CurNode = CurNode->BST_Left;
else
CurNode = CurNode->BST_Right;
}
return (CurNode);
}
b. Them mot nut vao trong cay:

Gia s chung ta can them mot nut co thanh phan d lieu (Key) la NewData vao trong
cay nh phan tm kiem sao cho sau khi them cay van la mot cay nh phan tm kiem.
Trong thao tac nay trc het chung ta phai tm kiem v tr them, sau o mi tien
hanh them nut mi vao cay (Do vay thuat toan con c goi la thuat toan tm kiem
va them vao cay). Qua trnh tm kiem tuan thu cac bc trong thuat toan tm kiem
a trnh bay tren.
Trong thuat toan nay chung ta se trnh bay thao tac them vao cay nh phan tm kiem
trong trng hp khong co hien tng trung lap khoa. Do vay, neu NewData b trung
Trang: 169
vi Key cua mot trong cac nut trong cay nh phan tm kiem th chung ta se khong
thc hien thao tac them nay. Tuy nhien, neu chung ta s dung cau truc d lieu m
rong th viec trung khoa se giai quyet n gian v khong lam tang so nut cua cay nh
phan tm kiem ma ch lam tang thanh phan Count cua nut b trung khoa them 1.
- Thuat toan them 1 nut vao cay nh phan tm kiem:
B1: NewNode = BinT_Create_Node(NewData)
Thc hien Bkt
B3: IF (BSTree = NULL) // Cay rong
B3.1: BSTree = NewNode
B3.2: Thc hien Bkt
B4: CurNode = BSTree
B5: IF (CurNode->Key = NewData) // Trung khoa
Thc hien Bkt
B6: IF (CurNode->Key > NewData)
B6.1: AddLeft = True // Them vao cay con trai cua CurNode
B6.2: If (CurNode->BST_Left != NULL)
B7: IF (CurNode->Key < NewData)
B7.1: AddLeft = False // Them vao cay con phai cua CurNode
B7.2: If (CurNode->BST_Right != NULL)
B8: Lap lai B5
B9: IF (AddLeft = True)
CurNode->BST_Left = NewNode
B10: ELSE
CurNode->BST_Right = NewNode
Bkt: Ket thuc
Gia s chung ta can them vao trong cay nh phan tm kiem 1 nut co thanh phan
d lieu la 55: NewData = 55
NewNode CurNode BSTree
55 60
NULL NULL 25 65
19 40 NULL NULL
10 NULL 30 44
Trang: 170
CurNode->Key > NewData // Them vao cay con trai
AddLeft = True
CurNode->BST_Left != NULL // Chuyen sang cay con trai
BSTree
NewNode CurNode 60
55 25 65
NULL NULL 19 40 NULL NULL
10 NULL 30 44
CurNode->Key < NewData // Them vao cay con phai

AddLeft = False
CurNode->BST_Right != NULL // Chuyen sang cay con phai
BSTree
60
NewNode 25 CurNode 65
55 19 40 NULL NULL
NULL NULL 10 NULL 30 44
CurNode->Key < NewData // Them vao cay con ben phai

AddLeft = False
CurNode->BST_Right != NULL // Chuyen sang cay con ben phai
Trang: 171
BSTree
60
25 65
19 40 NULL NULL NewNode
CurNode
10 NULL 30 44 55
NULL NULL NULL NULL NULL NULL NULL NULL
CurNode->Key < NewData // Them vao cay con phai

AddLeft = False
CurNode->BST_Right == NULL
// Them NewNode vao thanh nut goc cay con phai cua CurNode
// (AddLeft = False), thuat toan ket thuc.
CurNode->BST_Right = NewNode
BSTree
60
25 65
19 40 NULL NULL
CurNode
10 NULL 30 44 NewNode
NULL NULL NULL NULL NULL 55
NULL NULL

Ham BST_Add_Node co prototype:
BST_Type BST_Add_Node(BST_Type &BS_Tree, T NewData);
Trang: 172
Ham thc hien viec them vao cay nh phan tm kiem BS_Tree mot nut co thanh
phan Key la NewData. Ham tra ve con tro tro ti a ch cua nut mi them neu
viec them thanh cong, trong trng hp ngc lai ham tra ve con tro NULL.
BST_Type BST_Add_Node(BST_Type &BS_Tree, T NewData)
{ BST_Type NewNode = BinT_Create_Node(NewData);
return (NewNode);
if (BS_Tree == NULL)
BS_Tree = NewNode;
else
{ BST_Type CurNode = BS_Tree;
int AddLeft = 1;
while (CurNode->Key != NewData)
{ if (CurNode->Key > NewData)
{ AddLeft = 1;
if (CurNode->BST_Left != NULL)
CurNode = CurNode->BST_Left;
else
break;
}
else // CurNode->Key < NewData
{ AddLeft = 0;
if (CurNode->BST_Right != NULL)
CurNode = CurNode->BST_Right;
else
break;
}
}
if (AddLeft == 1)
CurNode->BST_Left = NewNode;
else
CurNode->BST_Right = NewNode;
}
return (NewNode);
}
c. Loai bo (huy) mot nut tren cay:

Cung nh thao tac them mot nut vao trong cay nh phan tm kiem, thao tac huy mot
nut tren cay nh phan tm kiem cung phai bao am cho cay sau khi huy nut o th
cay van la mot cay nh phan tm kiem. ay la mot thao tac khong n gian bi neu
khong can than chung ta se bien cay thanh mot rng.
Gia s chung ta can huy nut co thanh phan d lieu (Key) la DelData ra khoi cay nh
phan tm kiem. ieu au tien trong thao tac nay la chung ta phai tm kiem a ch
cua nut can huy la DelNode, sau o mi tien hanh huy nut co a ch la DelNode nay
neu tm thay (Do vay thuat toan nay con c goi la thuat toan tm kiem va loai bo
tren cay). Qua trnh tm kiem a trnh bay tren, ay chung ta ch trnh bay thao
Trang: 173
tac huy khi tm thay nut co a ch DelNode (DelNode->Key = DelData) va trong qua
trnh tm kiem chung ta gi a ch nut cha cua nut can huy la PrDelNode.
Viec huy nut co a ch DelNode co the xay ra mot trong ba trng hp sau:
c1) DelNode la nut la:

Trong trng hp nay n gian chung ta ch can cat bo moi quan he cha-con gia
PrDelNode va DelNode bang cach cho con tro PrDelNode->BST_Left (neu DelNode la
nut con ben trai cua PrDelNode) hoac cho con tro PrDelNode->BST_Right (neu
DelNode la nut con ben phai cua PrDelNode) ve con tro NULL va tien hanh huy
(delete) nut co a ch DelNode nay.
V du: Gia s can huy nut co Key = 30 (DelData = 30)
BSTree
60
25 PrDelNode 65
19 DelNode 40 NULL NULL
10 NULL 30 44
Trong trng hp nay chung ta cho PrDelNode->BST_Left = NULL:

BSTree
60
25 PrDelNode 65
19 DelNode 40 NULL NULL
10 NULL NULL 44
30
NULL NULL NULL NULL
NULL NULL
Trang: 174

BSTree
60
25 PrDelNode 65
19 40 NULL NULL
10 NULL NULL 44
NULL NULL NULL NULL
c2) DelNode la nut ch co 01 nut goc cay con:

Trong trng hp nay cung kha n gian chung ta ch can chuyen moi quan he cha-
con gia PrDelNode va DelNode thanh moi quan he cha-con gia PrDelNode va nut
goc cay con cua DelNode roi tien hanh cat bo moi quan he cha-con gia DelNode va
01 nut goc cay con cua no va tien hanh huy nut co a ch DelNode nay.
V du: Gia s can huy nut co Key = 19 (DelData = 19)
BSTree
PrDelNode 60
DelNode 25 65
19 40 NULL NULL
10 NULL 30 44
Trang: 175
Trong trng hp nay chung ta thc hien cac bc:

B1: PrDelNode->BST_Left = DelNode->BST_Left
B2: DelNode->BST_Left = NULL
BSTree
PrDelNode 60
DelNode 25 65
19 40 NULL NULL
10 NULL NULL 30 44

BSTree
PrDelNode 60
25 65
10 40 NULL NULL
NULL NULL 30 44
NULL NULL NULL NULL
c3) DelNode la nut co u 02 nut goc cay con:

Trng hp nay kha phc tap, viec huy co the tien hanh theo mot trong hai cach sau
ay (co the co nhieu cach khac na song ay chung ta ch trnh bay hai cach):
- Chuyen 02 cay con cua DelNode ve thanh mot cay con:
Theo phng phap nay chung ta se chuyen cay con phai cua DelNode
(DelNodeBST_Right) ve thanh cay con phai cua cay con co nut goc la nut phai
nhat trong cay con trai cua DelNode (phai nhat trong DelNode->BST_Left), hoac
chuyen cay con trai cua DelNode (DelNode->BST_Left) ve thanh cay con trai cua
cay con co nut goc la nut trai nhat trong cay con phai cua DelNode (trai nhat trong
Trang: 176
DelNode->BST_Right). Sau khi chuyen th DelNode se tr thanh nut la hoac nut ch
co 01 cay con va chung ta huy DelNode nh oi vi trng hp c1) va c2) tren.
V du: Gia s can huy nut co Key = 25 (DelData = 25). Chung ta se chuyen cay con
phai cua DelNode (DelNode->BST_Right) ve thanh cay con phai cua cay con
co nut goc la nut phai nhat trong cay con trai cua DelNode (nut MRNode).
PrDelNode BSTree
DelNode 60
MRNode 25 65
19 40 NULL NULL
10 NULL 30 44
Trong trng hp nay chung ta thc hien cac bc:

B1: MRNode->BST_Right = DelNode->BST_Right
B2: DelNode->BST_Right = NULL
PrDelNode BSTree
DelNode 60
MRNode 25 65
19 NULL 40 NULL NULL
10 30 44
Trang: 177
Tien hanh cac bc e huy DelNode:

B3: PrDelNode->BST_Left = DelNode->BST_Left
B4: DelNode->BST_Left = NULL
PrDelNode BSTree
DelNode 60
MRNode 25 65
19 NULL NULL 40 NULL NULL
10 30 44

PrDelNode BSTree
MRNode 60
19 65
10 40 NULL NULL
NULL NULL 30 44
NULL NULL NULL NULL
- S dung phan t the mang (standby):

Theo phng phap nay chung ta se khong huy nut co a ch DelNode ma chung ta
se huy nut co a ch cua phan t the mang la nut phai nhat trong cay con trai cua
DelNode (MRNode), hoac la nut trai nhat trong cay con phai cua DelNode (MLNode).
Sau khi chuyen toan bo noi dung d lieu cua nut the mang cho DelNode
(DelNodeKey = MRNode->Key hoac DelNode->Key = MLNode->Key) th chung ta
se huy nut the mang nh oi vi trng hp c1) va c2) tren.
V du: Gia s can huy nut co Key = 25 (DelData = 25). Chung ta se chon phan t the
mang MLNode la nut trai nhat trong cay con phai cua DelNode (trai nhat trong
DelNode->BST_Right) e huy,
Trang: 178
BSTree
DelNode 60
25 PrMLNode 65
19 MLNode 40 NULL NULL
10 NULL 30 44
Chuyen d lieu trong MLNode ve cho DelNode: DelNode->Key = MLNode->Key

BSTree
DelNode 60
30 PrMLNode 65
10 NULL 30 44
Tien hanh huy MLNode (huy nut la): PrMLNode->BST_Left = NULL

BSTree
DelNode 60
30 PrMLNode 65
10 NULL 30 NULL 44
Trang: 179
BSTree
DelNode 60
30 PrMLNode 65
19 40 NULL NULL
10 NULL NULL 44
NULL NULL NULL NULL
- Thuat toan huy 1 nut trong cay nh phan tm kiem bang phng phap chuyen cay
con phai cua nut can huy ve thanh cay con phai cua cay con co nut goc la nut
phai nhat trong cay con trai cua nut can huy (neu nut can huy co u 02 cay con):
// Tm nut can huy va nut cha cua nut can huy
B1: DelNode = BSTree
B2: PrDelNode = NULL
Thc hien Bkt
B4: IF (DelNode->Key = DelData)
Thc hien B8
B5: IF (DelNode->Key > DelData) // Chuyen sang cay con trai
B5.1: PrDelNode = DelNode
B5.2: DelNode = DelNode->BST_Left
B5.3: OnTheLeft = True
B5.4: Thc hien B7
B6: IF (DelNode->Key < DelData) // Chuyen sang cay con phai
B6.2: DelNode = DelNode->BST_Right
B6.3: OnTheLeft = False
B6.4: Thc hien B7
B7: Lap lai B3
// Chuyen cac moi quan he cua DelNode cho cac nut khac
B8: IF (PrDelNode = NULL) // DelNode la nut goc
// Neu DelNode la nut la
B8.1: If (DelNode->BST_Left = NULL) and (DelNode->BST_Right = NULL)
B8.1.1: BSTree = NULL
// Neu DelNode co mot cay con phai
B8.2: If (DelNode->BST_Left = NULL) and (DelNode->BST_Right != NULL)
B8.2.1: BSTree = BSTree->BST_Right
Trang: 180
B8.2.2: DelNode->BST_Right = NULL
// Neu DelNode co mot cay con trai
B8.3: If (DelNode->BST_Left != NULL) and (DelNode->BST_Right = NULL)
B8.3.1: BSTree = BSTree->BST_Left
B8.3.2: DelNode->BST_Left = NULL
// Neu DelNode co hai cay con
B8.4: If (DelNode->BST_Left != NULL) and (DelNode->BST_Right != NULL)
// Tm nut phai nhat trong cay con trai cua DelNode
B8.4.1: MRNode = DelNode->BST_Left
B8.4.2: if (MRNode->BST_Right = NULL)
Thc hien B8.4.5
B8.4.3: MRNode = MRNode->BST_Right
B8.4.4: Lap lai B8.4.2
// Chuyen cay con phai cua DelNode ve cay con phai cua MRNode
B8.4.5: MRNode->BST_Right = DelNode->BST_Right
// Chuyen cay con trai con lai cua DelNode ve cho BSTree
B9: ELSE // DelNode khong phai la nut goc
// DelNode la cay con trai cua PrDelNode
B9.1.1: if (OnTheLeft = True)
PrDelNode->BST_Left = NULL
B9.1.2: else // DelNode la cay con phai cua PrDelNode
PrDelNode->BST_Right = NULL
PrDelNode->BST_Left = DelNode->BST_Right
B9.2.2: else
PrDelNode->BST_Right = DelNode->BST_Right
PrDelNode->BST_Left = DelNode->BST_Left
Trang: 181
B9.3.2: else
PrDelNode->BST_Right = DelNode->BST_Left
B9.4: If (DelNode->BST_Left != NULL) and (DelNode->BST_Right != NULL)
// Tm nut phai nhat trong cay con trai cua DelNode
B9.4.1: MRNode = DelNode->BST_Left
B9.4.2: if (MRNode->BST_Right = NULL)
Thc hien B9.4.5
B9.4.3: MRNode = MRNode->BST_Right
B9.4.4: Lap lai B9.4.2
// Chuyen cay con phai DelNode ve thanh cay con phai MRNode
B9.4.5: MRNode->BST_Right = DelNode->BST_Right
// Chuyen cay con trai con lai cua DelNode ve cho PrDelNode
B9.4.8: else
// Huy DelNode
B10: delete DelNode
Bkt: Ket thuc
Ham BST_Delete_Node_TRS co prototype:
int BST_Delete_Node_TRS(BST_Type &BS_Tree, T DelData);
Ham thc hien viec huy nut co thanh phan Key la DelData tren cay nh phan tm
kiem BS_Tree bang phng phap chuyen cay con phai cua nut can huy ve thanh
cay con phai cua cay co nut goc la nut phai nhat trong cay con trai cua nut can
huy (neu nut can huy co hai cay con). Ham tra ve gia tr 1 neu viec huy thanh
cong (co nut e huy), trong trng hp ngc lai ham tra ve gia tr 0 (khong ton
tai nut co Key la DelData hoac cay rong).
int BST_Delete_Node_TRS(BST_Type &BS_Tree, T DelData)
{ BST_Type DelNode = BS_Tree;
BST_Type PrDelNode = NULL;
int OnTheLeft = 0;
break;
PrDelNode = DelNode;
if (DelNode->Key > DelData)
Trang: 182
{ DelNode = DelNode->BST_Left;
OnTheLeft = 1;
}
else // (DelNode->Key < DelData)
{ DelNode = DelNode->BST_Right;
OnTheLeft = 0;
}
}
if (DelNode == NULL) // Khong co nut e huy
return (0);
if (PrDelNode == NULL) // DelNode la nut goc
{ if (DelNode->BST_Left == NULL && DelNode->BST_Right == NULL)
BS_Tree = NULL;
else
if (DelNode->BST_Left == NULL) // DelNode co 1 cay con phai
{ BS_Tree = BS_Tree->BST_Right;
DelNode->BST_Right = NULL;
}
else
if (DelNode->BST_Right == NULL) // DelNode co 1 cay con trai
{ BS_Tree = BS_Tree->BST_Left;
DelNode->BST_Left = NULL;
}
else // DelNode co hai cay con
{ BST_Type MRNode = DelNode->BST_Left;
while (MRNode->BST_Right != NULL)
MRNode = MRNode->BST_Right;
MRNode->BST_Right = DelNode->BST_Right;
BS_Tree = BS_Tree->BST_Left;
}
}
else // DelNode la nut trung gian
if (OnTheLeft == 1)
PrDelNode->BST_Left = NULL;
else
PrDelNode->BST_Right = NULL;
else
{ if (OnTheLeft == 1)
PrDelNode->BST_Left = DelNode->BST_Right;
else
PrDelNode->BST_Right = DelNode->BST_Right;
}
else
Trang: 183
PrDelNode->BST_Left = DelNode->BST_Left;
else
PrDelNode->BST_Right = DelNode->BST_Left;
}
else // DelNode co hai cay con
{ BST_Type MRNode = DelNode->BST_Left;
while (MRNode->BST_Right != NULL)
MRNode = MRNode->BST_Right;
MRNode->BST_Right = DelNode->BST_Right;
if (OnTheLeft == 1)
else
}
}
delete DelNode;
return (1);
}
- Thuat toan huy 1 nut trong cay nh phan tm kiem bang phng phap huy phan t
the mang la phan t trai nhat trong cay con phai cua nut can huy (neu nut can
huy co u 02 cay con):
B1: DelNode = BSTree
Thc hien Bkt
B4: IF (DelNode->Key = DelData)
Thc hien B8
B5: IF (DelNode->Key > DelData) // Chuyen sang cay con trai
B5.2: DelNode = DelNode->BST_Left
B5.4: Thc hien B7
B6: IF (DelNode->Key < DelData) // Chuyen sang cay con phai
B6.2: DelNode = DelNode->BST_Right
B6.4: Thc hien B7
B7: Lap lai B3
B8: IF (PrDelNode = NULL) // DelNode la nut goc
Trang: 184
B8.1.1: BSTree = NULL
B8.2.1: BSTree = BSTree->BST_Right
B9: ELSE // DelNode khong phai la nut goc
// DelNode la cay con trai cua PrDelNode
PrDelNode->BST_Left = NULL
B9.1.2: else // DelNode la cay con phai cua PrDelNode
PrDelNode->BST_Right = NULL
PrDelNode->BST_Left = DelNode->BST_Right
B9.2.2: else
PrDelNode->BST_Right = DelNode->BST_Right
B9.3.2: else
B10: If (DelNode->BST_Left != NULL) and (DelNode->BST_Right != NULL)
// Tm nut trai nhat trong cay con phai cua DelNode va nut cha cua no
B10.1: MLNode = DelNode->BST_Right
B10.2: PrMLNode = DelNode
Trang: 185
B10.3: if (MLNode->BST_Left = NULL)
Thc hien B10.7
B10.4: PrMLNode = MLNode
B10.5: MLNode = MLNode->BST_Left
B10.6: Lap lai B10.3
// Chep d lieu t MLNode ve DelNode
B10.7: DelNode->Key = MLNode->Key
// Chuyen cay con phai cua MLNode ve cay con trai cua PrMLNode
B10.8: if (PrMLNode = DelNode) // MLNode la nut phai cua PrMLNode
PrMLNode->BST_Right = MLNode->BST_Right
B10.9: else // MLNode la nut trai cua PrMLNode
PrMLNode->BST_Left = MLNode->BST_Right
B10.10: MLNode->BST_Right = NULL
// Chuyen vai tro cua MLNode cho DelNode
B10.11: DelNode = MLNode
B10.12: Thc hien B11
// Huy DelNode
B11: delete DelNode
Bkt: Ket thuc
Ham BST_Delete_Node_SB co prototype:
int BST_Delete_Node_SB(BST_Type &BS_Tree, T DelData);
Ham thc hien viec huy nut co thanh phan Key la DelData tren cay nh phan tm
kiem BS_Tree bang phng phap huy phan t the mang la phan t trai nhat trong
cay con phai cua nut can huy (neu nut can huy co hai cay con). Ham tra ve gia
tr 1 neu viec huy thanh cong (co nut e huy), trong trng hp ngc lai ham tra
ve gia tr 0 (khong ton tai nut co Key la DelData hoac cay rong).
int BST_Delete_Node_SB(BST_Type &BS_Tree, T DelData)
BST_Type PrDelNode = NULL;
int OnTheLeft = 0;
break;
PrDelNode = DelNode;
if (DelNode->Key > DelData)
{ DelNode = DelNode->BST_Left;
OnTheLeft = 1;
}
else // (DelNode->Key < DelData)
{ DelNode = DelNode->BST_Right;
OnTheLeft = 0;
}
}
Trang: 186
if (DelNode == NULL) // Khong co nut e huy
return (0);
if (PrDelNode == NULL) // DelNode la nut goc
BS_Tree = NULL;
else
{ BS_Tree = BS_Tree->BST_Right;
}
else
{ BS_Tree = BS_Tree->BST_Left;
}
}
else // DelNode la nut trung gian
if (OnTheLeft == 1)
PrDelNode->BST_Left = NULL;
else
PrDelNode->BST_Right = NULL;
else
PrDelNode->BST_Left = DelNode->BST_Right;
else
PrDelNode->BST_Right = DelNode->BST_Right;
}
else
else
}
}
// DelNode co hai cay con
if (DelNode->BST_Left != NULL && DelNode->BST_Right != NULL)
{ BST_Type MLNode = DelNode->BST_Right;
BST_Type PrMLNode = DelNode;
while (MLNode->BST_Left != NULL)
{ PrMLNode = MLNode;
MLNode = MLNode->BST_Left;
}
DelNode->Key = MLNode->Key;
Trang: 187
if (PrMLNode == DelNode)
PrMLNode->BST_Right = MLNode->BST_Right;
else
PrMLNode->BST_Left = MLNode->BST_Right;
MLNode->BST_Right = NULL;
DelNode = MLNode;
}
delete DelNode;
return (1);
}
d. Huy toan bo cay:

Thao tac ch n gian la viec thc hien nhieu lan thao tac huy mot nut tren cay nh
phan tm kiem cho en khi cay tr thanh rong.
Ham BST_Delete co prototype:
void BST_Delete(BST_Type &BS_Tree);
Ham thc hien viec huy tat ca cac nut trong cay nh phan tm kiem BS_Tree.
void BST_Delete(BST_Type &BS_Tree)
while (BST_Delete_Node_TRS(BS_Tree, DelNode->Key) == 1)
DelNode = BS_Tree;
return;
}
5.3. Cay can bang (Balanced Tree)

5.3.1. nh ngha Cau truc d lieu
a. nh ngha:
- Cay can bang tng oi:
Theo Adelson-Velskii va Landis a ra nh ngha ve cay can bang tng oi nh
sau:
Cay can bang tng oi la mot cay nh phan thoa man ieu kien la oi vi moi
nut cua cay th chieu cao cua cay con trai va chieu cao cua cay con phai cua nut
o hn kem nhau khong qua 1.
Cay can bang tng oi con c goi la cay AVL (AVL tree).
- Cay can bang hoan toan:
Cay can bang hoan toan la mot cay nh phan thoa man ieu kien la oi vi moi
nut cua cay th so nut cay con trai va so nut cay con phai cua nut o hn kem
nhau khong qua 1.
Nh vay, mot cay can bang hoan toan chac chan la mot cay can bang tng oi.
Trang: 188
b. Cau truc d lieu cua cay can bang:
e ghi nhan mc o can bang tai moi nut goc cay con chung ta s dung them mot
thanh phan Bal trong cau truc d lieu cua moi nut. Do vay, cau truc d lieu cua cay
nh phan tm kiem can bang tng oi va cay nh phan tm kiem can bang hoan toan
noi rieng va cua cay can bang noi chung tng t nh cau truc d lieu cua cay nh
phan ngoai tr trong o chung ta a them thanh phan Bal lam ch so can bang tai
moi nut nh sau:
typedef struct BAL_Node
{ T Key;
int Bal; // Ch so can bang tai nut goc cay con
BAL_Node * BAL_Left; // Vung lien ket quan ly a ch nut goc cay con trai
BAL_Node * BAL_Right; // Vung lien ket quan ly a ch nut goc cay con phai
} BAL_OneNode;
typedef BAL_OneNode * BAL_Type;
e quan ly cac cay nh phan tm kiem can bang chung ta ch can quan ly a ch nut
goc cua cay:
BAL_Type BALTree;
Gia tr ch so can bang Bal tai mot nut goc cay con trong cay can bang tng oi
bang hieu so gia chieu cao cay con trai va chieu cao cay con phai cua nut o.
Gia tr ch so can bang Bal tai mot nut goc cay con trong cay can bang hoan toan
bang hieu so gia so nut cay con trai va so nut cay con phai cua nut o.
Nh vay, neu tai moi nut trong cay nh phan ma thoa man ieu kien -1 Bal 1 th
cay la cay can bang va pham vi t 1 en +1 la pham vi cho phep cua ch so can
bang Bal:
+ Neu Bal = 0: cay con trai va cay con phai eu nhau
+ Neu Bal = -1: cay con trai nho hn (thap hn) cay con phai (lech phai)
+ Neu Bal = +1: cay con trai ln hn (cao hn) cay con phai (lech trai)
5.3.2. Cac thao tac
Trong pham vi cua phan nay chung ta xem xet cac thao tac tren cay nh phan tm
kiem can bang tng oi. Cac thao tac tren cay can bang hoan toan sinh vien t van
dung tng t. Do vay, khi trnh bay cac thao tac ma noi ti cay can bang ngha la
cay nh phan tm kiem can bang va chung ta cung ch xet cay nh phan tm kiem
trong trng hp khong trung khoa nhan dien.
Trong cac thao tac tren cay nh phan tm kiem can bang tng oi th co hai thao tac
Them mot nut vao cay va Huy mot nut khoi cay la hai thao tac kha phc tap v co
nguy c pha v s can bang cua cay, khi o chung ta phai thc hien viec can bang
lai cay. Cac thao tac khac hoan toan tng t nh trong cay nh phan noi chung va
cay nh phan tm kiem noi rieng. Do vay, trong phan nay chung ta ch trnh bay hai
thao tac nay ma thoi.
Trang: 189
a. Them mot nut vao cay can bang:
Gia s chung ta can them mot nut NewNode co thanh phan d lieu la NewData vao
trong cay can bang BALTree sao cho sau khi them BALTree van la mot cay can
bang. e thc hien ieu nay trc het chung ta tm kiem v tr cua nut can them la
nut con trai hoac nut con phai cua mot nut PrNewNode tng t nh trong cay nh
phan tm kiem. Sau khi them NewNode vao cay con trai hoac cay con phai cua
PrNewNode th ch so can bang cua cac nut t PrNewNode tr ve cac nut trc se b
thay oi day chuyen va chung ta phai lan ngc t PrNewNode ve theo cac nut trc
e theo doi s thay oi nay. Neu phat hien tai mot nut AncestorNode co s thay oi
vt qua pham vi cho phep (bang 2 hoac +2) th chung ta tien hanh can bang lai
cay ngay tai nut AncestorNode nay.
Viec can bang lai cay tai nut AncestorNode c tien hanh cu the theo cac trng
hp nh sau:
Trng hp 1: Neu AncestorNode->Bal = -2:
Goi: AncL = AncestorNode->BAL_Left
AncR = AncestorNode->BAL_Right
AncL co chieu cao la h va AncR co chieu cao la h+2 (h 0)
Co t nhat 1 cay con cua AncR co chieu cao la h+1
Goi: AncRL = AncR->BAL_Left
AncRR = AncR->BAL_Right
Cay con co nut goc AncestorNode co the vao mot trong ba dang sau:
a1) AncRL co chieu cao la h va AncRR co chieu cao la h+1 (AncR->Bal = -1)
AncestorNode
AncL -2 AncR
AncRL -1 AncRR
h h+1
e can bang lai AncestorNode chung ta thc hien viec quay n cay con phai AncR
cua nut nay len thanh nut goc; chuyen AncestorNode thanh nut con trai cua nut goc
va AncestorNode co hai cay con la AncL va AncRL (BAL_Right Rotation).
Cay con AncestorNode sau khi quay cay con phai AncR se la mot cay can bang.
V du: Viec them nut co Key = 50 vao cay nh phan tm kiem can bang sau ay se
lam cho cay mat can bang va chung ta phai can bang lai theo trng hp nay:
Trang: 190
BALTree
25 -1
19 0 40 0
NULL NULL 30 0 44 0
NULL NULL NULL NULL
e thc hien can bang lai bang phep quay n nay chung ta thc hien cac bc sau:
B1: AncestorNode->BAL_Right = AncR->BAL_Left
AncestorNode
AncL -2 AncR
-1 AncRR
h h+1
B2: AncR->BAL_Left = AncestorNode

AncestorNode
AncL -2 AncR
-1 AncRR
h h+1
B3: AncR->Bal = AncestorNode->Bal = 0
Trang: 191
Viec quay ket thuc, cay tr thanh cay can bang.
AncR
AncestorNode 0 AncRR
AncL 0 AncRL
h h h+1
Chuyen vai tro cua AncR cho AncestorNode: AncestorNode = AncR

Ket qua sau phep quay:
AncestorNode AncR
0 AncRR
AncL 0 AncRL
h h h+1
V du: Them nut co Key = 50 vao cay nh phan tm kiem can bang sau ay:
BALTree
25 -1
19 0 40 0
NULL NULL 30 0 44 0
NULL NULL NULL NULL
Cay nh phan tm kiem can bang sau khi them nut co Key = 50 nh sau:
Trang: 192
BALTree
25 -2
19 0 40 -1
NULL NULL 30 0 44 -1
NULL NULL NULL 50 0
NULL NULL
Thc hien quay cay con phai cua BALTree, cay nh phan tm kiem sau khi quay tr
thanh cay nh phan tm kiem can bang nh sau:
BALTree
40 0
25 0 44 -1
19 0 30 0 NULL 50 0
b1) AncRL va AncRR eu co chieu cao la h+1 (AncR->Bal = 0)

AncestorNode
AncL -2 AncR
AncRL 0 AncRR
h+1 h+1
Viec bang lai c thc hien tng t nh trng hp a1) tren:

B1: AncestorNode->BAL_Right = AncR->BAL_Left
Trang: 193
AncestorNode
AncL -2 AncR
0 AncRR
h+1 h+1
B2: AncR->BAL_Left = AncestorNode

AncestorNode
AncL -2 AncR
0 AncRR
h+1 h+1
B3: AncR->Bal = 1, AncestorNode->Bal = -1

Viec quay ket thuc, cay tr thanh cay can bang.
AncR
AncestorNode 1 AncRR
AncL -1 AncRL
h h+1 h+1
Chuyen vai tro cua AncR cho AncestorNode: AncestorNode = AncR
Trang: 194
Ket qua sau phep quay:
AncestorNode AncR
1 AncRR
AncL -1 AncRL
h h+1 h+1
c1) AncRL co chieu cao la h+1 va AncRR co chieu cao la h (AncR->Bal = 1)

AncestorNode
AncL -2 AncR
AncRL 1 AncRR
h+1 h
e can bang lai AncestorNode chung ta thc hien viec quay kep: quay cay con trai
AncRL va quay cay con phai AncR (Double Rotation).
BALTree
25 -1
19 0 40 0
NULL NULL 30 0 44 0
NULL NULL NULL NULL
Trang: 195
Viec quay c tien hanh cu the nh sau:
Goi: AncRLL = AncRL->BAL_Left
AncRLR = AncRL->BAL_Right
AncRLL va AncRLR co chieu cao toi a la h
- AncRLL co chieu cao la h va AncRLR co chieu cao la h-1 (AncRL->Bal =1; h 1)
AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h 1
AncRLL AncRLR
h-1
e can bang lai AncestorNode au tien chung ta thc hien viec quay n cay con
trai AncRL cua AncR len thanh nut goc cay con phai cua AncestorNode, chuyen
AncR nut thanh nut goc cay con phai cua AncRL va chuyen AncRLR thanh nut goc
cay con trai cua AncR. Sau khi quay cay se tr thanh:
AncestorNode
AncL -2 AncRL
AncRLL -1 AncR
h AncRLR -1
AncRR
h-1
Trang: 196
Bay gi chung ta tiep tuc thc hien viec quay n cay con phai AncRL cua
AncestorNode len thanh nut goc va chuyen AncRLL nut thanh nut goc cay con phai
cua AncestorNode. Sau khi quay cay se tr nen can bang:
AncRL
AncestorNode 0 AncR
AncL 0 AncRLL AncRLR -1 AncRR
h-1
h h h
Nh vay e thc hien qua trnh quay kep nay chung ta thc hien cac bc sau:
B1: AncestorNode->BAL_Right = AncRL->BAL_Left
AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h 1
AncRLL AncRLR
h-1
Trang: 197
B2: AncR->BAL_Left = AncRL->BAL_Right
AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h 1
AncRLL AncRLR
h-1
B3: AncRL->BAL_Left = AncestorNode

AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h 1
AncRLL AncRLR
h-1
Trang: 198
B4: AncRL->BAL_Right = AncR
AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h 1
AncRLL AncRLR
h-1
Hieu chnh lai cac ch so can bang:

B5: AncestorNode->Bal = 0
B6: AncRL->Bal = 0
B7: AncR->Bal = -1
Chuyen vai tro cua AncRL cho AncestorNode va chung ta co cay can bang mi:
B8: AncestorNode = AncRL
AncestorNode AncRL
0 AncR
AncL 0 AncRLL AncRLR -1 AncRR
h-1
h h h
Trang: 199
- AncRLL co chieu cao la h-1 va AncRLR co chieu cao la h (AncRL->Bal =-1; h 1)
AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h -1
AncRLL AncRLR
h-1
e can bang lai AncestorNode hoan toan giong vi trng hp tren, duy ch khac
nhau ve gia tr ch so can bang sau khi quay kep. Chung ta cung thc hien cac bc
sau:
B6: AncR->Bal = 0
B7: AncRL->Bal = 0
Sau khi quay kep cay se tr thanh:
AncestorNode AncRL
0 AncR
AncL 1 AncRLL AncRLR 0 AncRR
h-1
h h h
Trang: 200
- Ca AncRLL va AncRLR eu co chieu cao la h (AncRL->Bal =0; h 0)
AncestorNode
AncL -2 AncR
AncRL 1
AncRR
h 0
AncRLL AncRLR
h h
Cung tng t, chung ta can bang lai AncestorNode bang cach quay kep giong nh
trng hp tren nhng ve gia tr ch so can bang sau khi quay th khac nhau. Cac
bc thc hien nh sau:
B6: AncR->Bal = 0
B7: AncRL->Bal = 0
Sau khi quay kep cay se tr thanh:
AncestorNode AncRL
0 AncR
AncL 0 AncRLL AncRLR 0 AncRR
h h h h
Trang: 201
BALTree
25 -1
19 0 40 0
NULL NULL 30 0 44 0
NULL NULL NULL NULL
BALTree
25 -2
19 0 40 1
NULL NULL 30 1 44 0
27 0 NULL NULL NULL
NULL NULL
Thc hien quay n cay con trai cua BALTree->BAL_Right cay nh phan tm kiem
sau khi quay tr thanh cay nh phan tm kiem nh sau:
BALTree
25 -2
19 0 30 -1
NULL NULL 27 0 40 -1
NULL NULL NULL 44 0
NULL NULL
Thc hien quay n cay con phai cua BALTree cay nh phan tm kiem sau khi quay
tr thanh cay nh phan tm kiem can bang nh sau:
Trang: 202
BALTree
30 0
25 0 40 -1
19 0 27 0 NULL 44 0
Trng hp 2: Neu AncestorNode->Bal = 2:

Cung tng t nh trng hp 1 song ay chung ta se thc hien quay n hoac
quay kep cac nhanh pha ngc lai
Goi: AncL = AncestorNode->BAL_Left
AncR = AncestorNode->BAL_Right
AncL co chieu cao la h+2 va AncR co chieu cao la h (h 0)
Co t nhat 1 cay con cua AncL co chieu cao la h+1
Goi: AncLL = AncL->BAL_Left
AncLR = AncL->BAL_Right
a2) AncLL co chieu cao la h+1 va AncLR co chieu cao la h (AncL->Bal = 1)
AncestorNode
AncL 2 AncR
AncLL 1 AncLR
h+1 h
e can bang lai AncestorNode chung ta thc hien viec quay n cay con trai AncL
cua nut nay len thanh nut goc; chuyen AncestorNode thanh nut con phai cua nut goc
va AncestorNode co hai cay con la AncLR va AncR (BAL_Left Rotation).
Trang: 203
BALTree
50 1
35 0 70 0
20 0 40 0 NULL NULL
NULL NULL NULL NULL
Cac bc thc hien viec can bang lai bang phep quay nay nh sau:
B1: AncestorNode->BAL_Left = AncL->BAL_Right
B2: AncL->BAL_Right = AncestorNode
B3: AncL->Bal = AncestorNode->Bal = 0
Chuyen vai tro cua AncL cho AncestorNode:
B4: AncestorNode = AncL
Ket qua sau phep quay n cay con trai:
AncL AncestorNode
AncLL 0
AncLR 0 AncR
h+1 h h
BALTree
50 1
35 0 70 0
20 0 40 0 NULL NULL
NULL NULL NULL NULL
Trang: 204
BALTree
50 2
35 1 70 0
20 1 40 0 NULL NULL
10 0 NULL NULL NULL
NULL NULL
Thc hien quay cay con trai cua BALTree, cay nh phan tm kiem sau khi quay tr
thanh cay nh phan tm kiem can bang nh sau:
BALTree
35 0
20 1 50 0
10 0 NULL 40 0 70 0
b2) AncLL va AncLR eu co chieu cao la h+1 (AncL->Bal = 0)

AncestorNode
AncL 2 AncR
AncLL 0 AncLR
h+1 h+1
Trang: 205
Viec can bang lai AncestorNode cung thc hien thao tac quay n nh tren song ch
so can bang se khac. Do vay, cac bc thc hien viec quay nh sau:
B1: AncestorNode->BAL_Left = AncL->BAL_Right
B2: AncL->BAL_Right = AncestorNode
B3: AncL->Bal = -1
Chuyen vai tro cua AncL cho AncestorNode:
B5: AncestorNode = AncL
Ket qua sau phep quay n cay con trai:
AncL AncestorNode
AncLL -1
AncLR 1 AncR
h+1 h+1 h
c2) AncLL co chieu cao la h va AncLR co chieu cao la h+1 (AncL->Bal = -1)
AncestorNode
AncL 2 AncR
AncLL -1 AncLR
h h+1
Cung tng t nh trng hp c1) Viec can bang lai AncestorNode c thc hien
thong qua phep quay kep: quay cay con phai AncLR va quay cay con trai AncL
(Double Rotation).
Trang: 206
BALTree
50 1
35 0 70 0
20 0 40 0 NULL NULL
NULL NULL NULL NULL
Viec quay c tien hanh cu the nh sau:

Goi: AncLRL = AncLR->BAL_Left
AncLRR = AncLR->BAL_Right
AncLRL va AncLRR co chieu cao toi a la h
- AncLRL co chieu cao la h-1 va AncLRR co chieu cao la h (AncRL->Bal =-1; h 1)
AncestorNode
AncL 2 AncR
AncLL -1 AncLR
AncLRL -1 AncLRR h
h-1
Qua trnh quay kep c thc hien thong cac bc sau:

B1: AncestorNode->BAL_Left = AncLR->BAL_Right
B2: AncL->BAL_Right = AncLR->BAL_Left
B3: AncLR->BAL_Right = AncestorNode
B4: AncLR->BAL_Left = AncL
B6: AncLR->Bal = 0
Trang: 207
B7: AncL->Bal = 1
Chuyen vai tro cua AncLR cho AncestorNode va chung ta co cay can bang mi:
B8: AncestorNode = AncLR
AncestorNode AncLR
AncL 0
AncLL 1 AncLRL AncLRR 0 AncR
h-1
h h h
- AncLRL co chieu cao la h va AncLRR co chieu cao la h-1 (AncRL->Bal =1; h 1)

AncestorNode
AncL 2 AncR
AncLL -1 AncLR
AncLRL 1 AncLRR h
h-1

B5: AncestorNode->Bal = -1
B6: AncLR->Bal = 0
B7: AncL->Bal = 0
Trang: 208
AncestorNode AncLR
AncL 0
AncLL 0 AncLRL AncLRR -1 AncR
h-1
h h h
- Ca AncLRL va AncLRR eu co chieu cao la h (AncRL->Bal =0; h 0)

AncestorNode
AncL 2 AncR
AncLL -1 AncLR
AncLRL 1 AncLRR h
h h

B6: AncLR->Bal = 0
B7: AncL->Bal = 0
Trang: 209
AncestorNode AncLR
AncL 0
AncLL 0 AncLRL AncLRR 0 AncR
h h h h
BALTree
50 1
35 0 70 0
20 0 40 0 NULL NULL
NULL NULL NULL NULL
BALTree
50 2
35 -1 70 0
20 0 40 -1 NULL NULL
NULL NULL NULL 44 0
NULL NULL
Thc hien quay cay con phai cua BALTree->BAL_Left, cay nh phan tm kiem sau khi
quay tr thanh cay nh phan tm kiem nh sau:
Trang: 210
BALTree
50 2
40 1 70 0
35 1 44 0 NULL NULL
20 0 NULL NULL NULL
NULL NULL
Thc hien quay cay con phai cua BALTree->BAL_Left, cay nh phan tm kiem sau khi
quay tr thanh cay nh phan tm kiem nh sau:
BALTree
40 0
35 1 50 0
20 0 NULL 44 0 70 0
- Thuat toan e quy e them 1 nut vao cay nh phan tm kiem can bang tng oi
(AddNew):
// Tao nut mi co Key la NewData e them vao cay NPTKCBT
B1: NewNode = new BAL_OneNode
Thc hien Bkt
B3: NewNode->BAL_Left = NewNode->BAL_Right = NULL
B4: NewNode->Key = NewData
B5: NewNode->Bal = 0
B6: IF (BALTree = NULL) // Cay rong
B6.1: BALTree = NewNode
B6.2: Taller = True // Cay NPTKCBT b cao len hn trc khi them
B6.3: Thc hien Bkt
B7: IF (BALTree->Key = NewData) // Trung khoa
Thc hien Bkt
B8: IF (BALTree->Key < NewData)
// Them e quy vao cay con phai cua BALTree
Trang: 211
B8.1: AddNew(NewData, BALTree->BAL_Right, Taller)
B8.2: If (Taller = True) // Viec them vao lam cho cay con phai cao them
B8.2.1: if (BALTree->Bal = 1) // Cay se can bang tot hn
B8.2.1.1: BALTree->Bal = 0
B8.2.1.2: Taller = False
B8.2.2: if (BALTree->Bal = 0) // Cay van con can bang
B8.2.2.1: BALTree->Bal = -1
B8.2.3: if (BALTree->Bal = -1)
// Cay mat can bang theo trng hp 1, phai can bang lai
B8.2.3.1: AncR = BALTree->BAL_Right
B8.2.3.2: if (AncR->Bal 1) // Thc hien quay n theo a1), b1)
B8.2.3.2.1: BALTree->BAL_Right = AncR->BAL_Left
B8.2.3.2.2: AncR->BAL_Left = BALTree
B8.2.3.2.3: if (AncR->Bal = -1)
BALTree->Bal = AncR->Bal = 0
B8.2.3.2.4: else
AncR->Bal = 1
B8.2.3.2.5: BALTree = AncR
B8.2.3.3: else // Thc hien quay kep theo c1)
B8.2.3.3.1: AncRL = AncR->BAL_Left
B8.2.3.3.2: BALTree->BAL_Right = AncRL->BAL_Left
B8.2.3.3.3: AncR->BAL_Left = AncRL->BAL_Right
B8.2.3.3.4: AncRL->BAL_Left = BALTree
B8.2.3.3.5: AncRL->BAL_Right = AncR
B8.2.3.3.6: if (AncRL->Bal = 1)
B8.2.3.3.6.1: BALTree->Bal = AncRL->Bal = 0
B8.2.3.3.6.2: AncR->Bal = -1
B8.2.3.3.7: if (AncRL->Bal = -1)
AncR->Bal = AncRL->Bal = 0
B8.2.3.3.8: if (AncRL->Bal = 0)
AncR->Bal = BALTree->Bal = 0
B8.2.3.3.9: BALTree = AncRL
B9: IF (BALTree->Key > NewData)
// Them e quy vao cay con trai cua BALTree
B9.1: AddNew(NewData, BALTree->BAL_Left, Taller)
B9.2: If (Taller = True) // Viec them vao lam cho cay con trai cao them
B9.2.1: if (BALTree->Bal = -1) // Cay se can bang tot hn
B9.2.2: if (BALTree->Bal = 0) // Cay van con can bang
B9.2.3: if (BALTree->Bal = 1)
Trang: 212
// Cay mat can bang theo trng hp 2, phai can bang lai
B9.2.3.1: AncL = BALTree->BAL_Left
B9.2.3.2: if (AncL->Bal -1) // Thc hien quay n theo a2), b2)
B9.2.3.2.1: BALTree->BAL_Left = AncL->BAL_Right
B9.2.3.2.2: AncL->BAL_Right = BALTree
B9.2.3.2.3: if (AncL->Bal = 1)
BALTree->Bal = AncL->Bal = 0
B9.2.3.2.4: else
AncL->Bal = -1
B9.2.3.3: else // Thc hien quay kep theo c2)
B9.2.3.3.1: AncLR = AncL->BAL_Right
B9.2.3.3.2: BALTree->BAL_Left = AncLR->BAL_Right
B9.2.3.3.3: AncL->BAL_Right = AncLR->BAL_Left
B9.2.3.3.4: AncLR->BAL_Right = BALTree
B9.2.3.3.5: AncLR->BAL_Left = AncL
B9.2.3.3.6: if (AncLR->Bal = -1)
B9.2.3.3.6.1: BALTree->Bal = AncLR->Bal = 0
B9.2.3.3.6.2: AncL->Bal = 1
B9.2.3.3.7: if (AncLR->Bal = 1)
AncL->Bal = AncLR->Bal = 0
B9.2.3.3.8: if (AncLR->Bal = 0)
AncL->Bal = BALTree->Bal = 0
B9.2.3.3.9: BALTree = AncLR
Bkt: Ket thuc
Ham BAL_Add_Node co prototype:
BAL_Type BAL_Add_Node (BAL_Type &BTree, T NewData, int &Taller);
Ham thc hien viec them vao cay nh phan tm kiem can bang BTree mot nut co
thanh phan Key la NewData. Ham tra ve con tro tro ti a ch cua nut mi them
neu viec them thanh cong, trong trng hp ngc lai ham tra ve con tro NULL.
Trong trng hp viec them lam cho cay phat trien chieu cao th Taller co gia tr
la 1, ngc lai Taller co gia tr la 0.
BAL_Type BAL_Add_Node (BAL_Type &BTree, T NewData, int &Taller)
{ if (BS_Tree == NULL)
{ BTree = new BAL_OneNode;
if (BTree != NULL)
{ BTree->Key = NewData;
BTree->Bal = 0;
BTree->BAL_Left = BTree->BAL_Right = NULL;
Taller = 1;
}
return (BTree);
}
Trang: 213
if (BTree->Key == NewData)
{ Taller = 0;
return (NULL);
}
if (BTree->Key < NewData)
{ BAL_Add_Node (BTree->BAL_Right, NewData, Taller);
if (Taller == 1)
{ switch (BTree->Bal)
{ case 1: BTree->Bal = 0;
Taller = 0;
break;
case 0: BTree->Bal = -1;
break;
case -1: BAL_Type AncR = BTree->BAL_Right;
if (AncR->Bal != 1)
{ BTree->BAL_Right = AncR->BAL_Left
AncR->BAL_Left = BTree;
if (AncR->Bal == -1)
BTree->Bal = AncR->Bal = 0;
else
AncR->Bal = 1;
BTree = AncR;
}
else
{ BAL_Type AncRL = AncR->BAL_Left;
BTree->BAL_Right = AncRL->BAL_Left;
AncR->BAL_Left = AncRL->BAL_Right;
AncRL->BAL_Left = BTree;
AncRL->BAL_Right = AncR;
if (AncRL->Bal == 1)
{ BTree->Bal = AncRL->Bal = 0;
AncR->Bal = -1;
}
else
if (AncRL->Bal == -1)
AncR->Bal = AncRL->Bal = 0;
else
AncR->Bal = BTree->Bal = 0;
BTree = AncRL;
}
Taller = 0;
break;
} // switch
} // if (Taller == 1)
} // if (BTree->Key < NewData)
else // (BTree->Key > NewData)
{ BAL_Add_Node (BTree->BAL_Left, NewData, Taller);
if (Taller == 1)
Trang: 214
{ switch (BTree->Bal)
{ case -1: BTree->Bal = 0;
Taller = 0;
break;
case 0: BTree->Bal = 1;
break;
case 1: BAL_Type AncL = BTree->BAL_Left;
if (AncL->Bal != -1)
{ BTree->BAL_Left = AncL->BAL_Right
AncL->BAL_Right = BTree;
if (AncL->Bal == 1)
BTree->Bal = AncL->Bal = 0;
else
AncL->Bal = -1;
BTree = AncL;
}
else
{ BAL_Type AncLR = AncL->BAL_Right;
BTree->BAL_Left = AncLR->BAL_Right;
AncL->BAL_Right = AncLR->BAL_Left;
AncLR->BAL_Right = BTree;
AncLR->BAL_Left = AncL;
if (AncLR->Bal == -1)
{ BTree->Bal = AncLR->Bal = 0;
AncL->Bal = 1;
}
else
if (AncLR->Bal == 1)
AncL->Bal = AncLR->Bal = 0;
else
AncL->Bal = BTree->Bal = 0;
BTree = AncLR;
}
Taller = 0;
break;
} // switch
} // if (Taller == 1)
} // else: (BTree->Key > NewData)
return (BTree);
}
b. Huy mot nut ra khoi cay can bang:

Tng t nh trong thao tac them, gia s chung ta can huy mot nut DelNode co
thanh phan d lieu la DelData ra khoi cay can bang BALTree sao cho sau khi huy
BALTree van la mot cay can bang. e thc hien ieu nay trc het chung ta phai
thc hien viec tm kiem v tr cua nut can huy la nut con trai hoac nut con phai cua
Trang: 215
mot nut PrDelNode tng t nh trong cay nh phan tm kiem. Viec huy cung chia
lam ba trng hp nh oi vi trong cay nh phan tm kiem:
- DelNode la nut la,
- DelNode la nut trung gian co 01 cay con,
- DelNode la nut co u 02 cay con.
Trong trng hp DelNode co u 02 cay con chung ta s dung phng phap huy
phan t the mang v theo phng phap nay se lam cho chieu cao cua cay t bien
ong hn phng phap kia.
Sau khi huy DewNode ra khoi cay con trai hoac cay con phai cua PrNewNode th ch
so can bang cua cac nut t PrDelNode tr ve cac nut trc cung se b thay oi day
chuyen va chung ta phai lan ngc t PrDelNode ve theo cac nut trc e theo doi
s thay oi nay. Neu phat hien tai mot nut AncNode co s thay oi vt qua pham vi
cho phep (bang 2 hoac +2) th chung ta tien hanh can bang lai cay ngay tai nut
AncNode nay.
Viec can bang lai cay tai nut AncNode c tien hanh cu the theo cac trng hp
tng t nh trong thao tac them:
- Thuat toan e quy e huy 1 nut trong cay nh phan tm kiem can bang tng oi
(BAL_Delete_Node):
B2: IF (BALTree = NULL)
B2.1: Shorter = False
B2.2: Thc hien Bkt
B3: PrDelNode = BALTree
B4: IF (BALTree->Key > DelData) // Chuyen sang cay con trai
B4.2: BAL_Delete_Node (BALTree->BAL_Left, DelData, Shorter)
B5: IF (BALTree->Key < DelData) // Chuyen sang cay con phai
B5.2: BAL_Delete_Node (BALTree->BAL_Right, DelData, Shorter)
B6: If (Shorter = True)
B6.1: if (OnTheLeft = True)
B6.1.1: if (BALTree->Bal = 1) // Cay can bang tot hn
B6.1.1.2: Shorter = False
// Cay van b thap nhng van con can bang
BALTree->Bal = -1
B6.1.3: if (BALTree->Bal = -1) // Cay mat can bang
B6.1.3.1: AncR = BALTree->BAL_Right
B6.1.3.2: if (AncR->Bal 1) // Thc hien quay n
B6.1.3.2.1: BALTree->BAL_Right = AncR->BAL_Left
B6.1.3.2.2: AncR->BAL_Left = BALTree
B6.1.3.2.3: if (AncR->Bal = -1)
Trang: 216
BALTree->Bal = AncR->Bal = 0
B6.1.3.2.4: else
AncR->Bal = 1
B6.1.3.3: else // Thc hien quay kep
B6.1.3.3.1: AncRL = AncR->BAL_Left
B6.1.3.3.2: BALTree->BAL_Right = AncRL->BAL_Left
B6.1.3.3.3: AncR->BAL_Left = AncRL->BAL_Right
B6.1.3.3.4: AncRL->BAL_Left = BALTree
B6.1.3.3.5: AncRL->BAL_Right = AncR
B6.1.3.3.6: if (AncRL->Bal = 1)
B6.1.3.3.6.1: BALTree->Bal = AncRL->Bal = 0
B6.1.3.3.6.2: AncR->Bal = -1
B6.1.3.3.7: if (AncRL->Bal = -1)
AncR->Bal = AncRL->Bal = 0
B6.1.3.3.8: if (AncRL->Bal = 0)
AncR->Bal = BALTree->Bal = 0
B6.1.3.3.9: BALTree = AncRL
B6.2: else // (OnTheLeft = False)
B6.2.1: if (BALTree->Bal = -1) // Cay can bang tot hn
BALTree->Bal = 1
B6.2.3: if (BALTree->Bal = 1) // Cay mat can bang
B6.2.3.1: AncL = BALTree->BAL_Left
B6.2.3.2: if (AncL->Bal -1) // Thc hien quay n
B6.2.3.2.1: BALTree->BAL_Left = AncL->BAL_Right
B6.2.3.2.2: AncL->BAL_Right = BALTree
B6.2.3.2.3: if (AncL->Bal = 1)
BALTree->Bal = AncL->Bal = 0
B6.2.3.2.4: else
AncL->Bal = 1
B6.2.3.2.5: BALTree = AncL
B6.2.3.3: else // Thc hien quay kep
B6.2.3.3.1: AncLR = AncL->BAL_Right
B6.2.3.3.2: BALTree->BAL_Left = AncLR->BAL_Right
B6.2.3.3.3: AncL->BAL_Right = AncLR->BAL_Left
B6.2.3.3.4: AncLR->BAL_Right = BALTree
B6.2.3.3.5: AncLR->BAL_Left = AncL
B6.2.3.3.6: if (AncLR->Bal = -1)
B6.2.3.3.6.1: BALTree->Bal = AncLR->Bal = 0
B6.2.3.3.6.2: AncL->Bal = 1
B6.2.3.3.7: if (AncLR->Bal = 1)
AncL->Bal = AncLR->Bal = 0
Trang: 217
B6.2.3.3.8: if (AncLR->Bal = 0)
AncL->Bal = BALTree->Bal = 0
B6.2.3.3.9: BALTree = AncLR
B7: IF (PrDelNode = NULL) // Huy la nut goc
// Neu nut can huy la nut la
B7.1: If (BALTree->BAL_Left = NULL) and (BALTree->BAL_Right = NULL)
B7.1.1: BALTree = NULL
B7.1.2: delete BALTree
// Neu nut can huy co mot cay con phai
B7.2: If (BALTree->BAL_Left = NULL) and (BALTree->BAL_Right != NULL)
B7.2.1: BALTree = BALTree->BAL_Right
B7.2.2: BALTree->BAL_Right = NULL
// Neu nut can huy co mot cay con trai
B7.3: If (BALTree->BAL_Left != NULL) and (BALTree->BAL_Right = NULL)
B7.3.1: BALTree = BALTree->BAL_Left
B7.3.2: BALTree->BAL_Left = NULL
B8: ELSE // nut can huy khong phai la nut goc
// Neu nut can huy la nut la
B8.1: If (BALTree->BAL_Left = NULL) and (BALTree->BAL_Right = NULL)
// Nut can huy la cay con trai cua PrDelNode
PrDelNode->BAL_Left = NULL
B8.1.2: else // Nut can huy la cay con phai cua PrDelNode
PrDelNode->BAL_Right = NULL
// Neu nut can huy co mot cay con phai
B8.2: If (BALTree->BAL_Left = NULL) and (BALTree->BAL_Right != NULL)
PrDelNode->BAL_Left = BALTree->BAL_Right
B8.2.2: else
PrDelNode->BAL_Right = BALTree->BAL_Right
B8.2.3: BALTree->BAL_Right = NULL
// Neu nut can huy co mot cay con trai
B8.3: If (BALTree->BAL_Left != NULL) and (BALTree->BAL_Right = NULL)
Trang: 218
PrDelNode->BAL_Left = BALTree->BAL_Left
B8.3.2: else
PrDelNode->BAL_Right = BALTree->BAL_Left
B8.3.3: BALTree->BAL_Left = NULL
B9: If (BALTree->BAL_Left != NULL) and (BALTree->BAL_Right != NULL)
// Tm nut trai nhat trong cay con phai cua nut can huy va nut cha cua no
B9.1: MLNode = BALTree->BAL_Right
B9.2: PrMLNode = BALTree
B9.3: if (MLNode->BAL_Left = NULL)
Thc hien B9.7
B9.4: PrMLNode = MLNode
B9.5: MLNode = MLNode->BAL_Left
B9.6: Lap lai B9.3
// Chep d lieu t MLNode ve DelNode
B9.7: BALTree->Key = MLNode->Key
// Chuyen cay con phai cua MLNode ve cay con trai cua PrMLNode
B9.8: if (PrMLNode = BALTree) // MLNode la nut phai cua PrMLNode
PrMLNode->BAL_Right = MLNode->BAL_Right
B9.9: else // MLNode la nut trai cua PrMLNode
PrMLNode->BAL_Left = MLNode->BAL_Right
B9.10: MLNode->BAL_Right = NULL
// Chuyen vai tro cua MLNode cho nut can huy
B9.11: BALTree = MLNode
Bkt: Ket thuc
Ham BAL_Del_Node co prototype:
int BAL_Del_Node(BAL_Type &BALTree, T Data,
int &Shorter, BAL_Type &PrDNode, int &OnTheLeft);
Ham thc hien viec huy nut co thanh phan Key la Data tren cay nh phan tm
kiem can bang BALTree bang phng phap huy phan t the mang la phan t phai
nhat trong cay con trai cua nut can huy (neu nut can huy co hai cay con). Ham
tra ve gia tr 1 neu viec huy thanh cong (co nut e huy), trong trng hp ngc
lai ham tra ve gia tr 0 (khong ton tai nut co Key la Data hoac cay rong).
int BAL_Del_Node(BAL_Type &BALTree, T Data,
int &Shorter, BAL_Type &PrDNode, int &OnTheLeft)
{ if (BALTree != NULL)
{ Shorter = 0;
PrDNode = NULL;
return (0)
}
Trang: 219
PrDNode = BALTree;
if (BALTree->Key > Data) // Huy nut cay con trai
{ OnTheLeft = 1;
return(BAL_Del_Node (BALTree->BAL_Left, Data, Shorter, PrDNode));
}
if (BALTree->Key < Data) // Huy nut cay con phai
{ OnTheLeft = 0;
return(BAL_Del_Node (BALTree->BAT_Right, Data, Shorter, PrDNode));
}
if (Shorter == True)
{ if (BALTree->Bal == 1) // Cay can bang tot hn
{ BALTree->Bal = 0;
Shorter = 0;
}
if (BALTree->Bal==0) //Cay van b thap nhng van con can bang
BALTree->Bal = -1;
if (BALTree->Bal == -1) // Cay mat can bang
{ BAL_Type AncR = BALTree->BAL_Right;
if (AncR->Bal != 1) // Thc hien quay n
{ BALTree->BAL_Right = AncR->BAL_Left;
AncR->BAL_Left = BALTree;
if (AncR->Bal == -1)
BALTree->Bal = AncR->Bal = 0;
else
AncR->Bal = 1;
BALTree = AncR;
}
else // Thc hien quay kep
{ BAL_Type AncRL = AncR->BAL_Left;
BALTree->BAL_Right = AncRL->BAL_Left;
AncR->BAL_Left = AncRL->BAL_Right;
AncRL->BAL_Left = BALTree;
AncRL->BAL_Right = AncR;
{ BALTree->Bal = AncRL->Bal = 0;
AncR->Bal = -1;
}
if (AncRL->Bal == -1)
AncR->Bal = AncRL->Bal = 0;
AncR->Bal = BALTree->Bal = 0;
BALTree = AncRL;
}
Shorter = 0;
}
}
else // (OnTheLeft = 0)
Trang: 220
{ if (BALTree->Bal == -1) // Cay can bang tot hn
{ BALTree->Bal = 0;
Shorter = 0;
}
if (BALTree->Bal == 0)
BALTree->Bal = 1;
if (BALTree->Bal == 1) // Cay mat can bang
{ BAL_Type AncL = BALTree->BAL_Left;
if (AncL->Bal != -1) // Thc hien quay n
{ BALTree->BAL_Left = AncL->BAL_Right;
AncL->BAL_Right = BALTree;
if (AncL->Bal == 1)
BALTree->Bal = AncL->Bal = 0;
else
AncL->Bal = 1;
BALTree = AncL;
}
else // Thc hien quay kep
{ BAL_Type AncLR = AncL->BAL_Right;
BALTree->BAL_Left = AncLR->BAL_Right;
AncL->BAL_Right = AncLR->BAL_Left;
AncLR->BAL_Right = BALTree;
AncLR->BAL_Left = AncL;
if (AncLR->Bal == -1)
{ BALTree->Bal = AncLR->Bal = 0;
AncL->Bal = 1;
}
AncL->Bal = AncLR->Bal = 0;
AncL->Bal = BALTree->Bal = 0;
BALTree = AncLR
}
Shorter = 0;
}
}
}
if (PrDNode == NULL) // huy nut goc
{ if (BALTree->BAL_Left == NULL && BALTree->BAL_Right == NULL)
BALTree = NULL;
else
if (BALTree->BST_Left == NULL) // nut can huy co 1 cay con phai
{ BALTree = BALTree->BAL_Right;
BALTree->BAL_Right = NULL;
}
else
if (BALTree->BAL_Right == NULL) //nut can huy co 1 cay con trai
Trang: 221
{ BALTree = BALTree->BAL_Left;
BALTree->BAL_Left = NULL;
}
}
else // nut can huy la nut trung gian
{ if (BALTree->BAL_Left == NULL && BALTree->BAL_Right == NULL)
if (OnTheLeft == 1)
PrDNode->BAL_Left = NULL;
else
PrDNode->BAL_Right = NULL;
else
if (BALTree->BAL_Left == NULL)
PrDNode->BAL_Left = BALTree->BAL_Right;
else
PrDNode->BAL_Right = BALTree->BAL_Right;
BALTree->BAL_Right = NULL;
}
else
if (BALTree->BAL_Right == NULL)
PrDNode->BAL_Left = BALTree->BAL_Left;
else
PrDNode->BAL_Right = BALTree->BAL_Left;
BALTree->BAL_Left = NULL;
}
}
if (BALTree->BAL_Left != NULL && BALTree->BAL_Right != NULL)
{ BAL_Type MLNode = BALTree->BAL_Right;
BAL_Type PrMLNode = BALTree;
while (MLNode->BAL_Left != NULL)
{ PrMLNode = MLNode;
MLNode = MLNode->BAL_Left;
}
BALTree->Key = MLNode->Key;
if (PrMLNode == BALTree)
PrMLNode->BAL_Right = MLNode->BAL_Right;
else
PrMLNode->BAL_Left = MLNode->BAL_Right;
MLNode->BAL_Right = NULL;
BALTree = MLNode;
}
delete BALTree;
return (1);
}
Trang: 222
Cau hoi va Bai tap
1. Trnh bay khai niem, ac iem va cau truc d lieu cua cac loai cay? So sanh vi
danh sach lien ket?
2. Hay a ra phng phap e chuyen t cau truc d lieu cua mot cay N-phan noi
chung thanh mot cay nh phan?
3. Trnh bay thuat toan va cai at tat ca cac thao tac tren cay nh phan tm kiem, cay
nh phan tm kiem can bang?
4. Trnh bay thuat toan va cai at tat ca cac thao tac tren cay nh phan tm kiem, cay
nh phan tm kiem can bang trong trng hp chap nhan s trung khoa nhan dien
cua cac nut trong cay?
5. Trnh bay tat ca cac thuat toan va cai at tat ca cac thuat toan e thc hien viec huy
mot nut tren cay nh phan tm kiem neu cay co 02 cay con? Theo ban, thuat toan
nao la n gian? Cho nhan xet ve moi thuat toan?
6. Trnh bay va cai at tat ca cac thuat toan e thc hien cac thao tac tren cay nh
phan tm kiem, cay nh phan tm kiem can bang trong hai trng hp: Chap nhan va
Khong chap nhan s trung lap ve khoa cua cac nut bang cach khong s dung thuat
toan e quy (Tr cac thao tac a trnh bay trong tai lieu)?
7. Trnh bay thuat toan va cai at chng trnh thc hien cac cong viec sau tren cay nh
phan:
a) Tnh so nut la cua cay.
b) Tnh so nut trung gian cua cay.
c) Tnh chieu dai ng i ti mot nut co khoa la K tren cay.
d) Cho biet cap cua mot nut co khoa la K tren cay.
8. Trnh bay thuat toan va cai at chng trnh thc hien cong viec tao cay nh phan
tm kiem ma khoa cua cac nut la khoa cua cac nut trong mot danh sach lien ket oi
sao cho toi u hoa bo nh. Biet rang, danh sach lien ket oi ban au khong can thiet
sau khi tao xong cay nh phan tm kiem va gia s khong cho phep s trung khoa
gia cac nut trong cay.
9. Vi yeu cau trong bai tap 8 tren, trong trng hp neu danh sach lien ket co nhieu
nut co thanh phan d lieu giong nhau, ban hay e xuat phng an giai quyet e
khong b mat d lieu sau khi tao xong cay nh phan tm kiem.
10. Trnh bay thuat toan va cai at chng trnh thc hien cong viec chuyen cay nh
phan tm kiem thanh danh sach lien ket oi sao cho toi u hoa bo nh. Biet rang,
cay nh phan tm kiem ban au khong can thiet sau khi tao xong danh sach lien ket
(ngc vi yeu cau trong bai tap 8).
11. Trnh bay thuat toan va cai at chng trnh thc hien cong viec nhap hai cay nh
phan tm kiem thanh mot cay nh phan tm kiem duy nhat sao cho toi u bo nh. Biet
rang, hai cay nh phan tm kiem ban au khong can thiet sau khi tao xong cay mi.
Trang: 223
ON TAP (REVIEW)
He thong lai cac Cau truc d lieu va cac Giai thuat a hoc
Chng 1: Tong quan ve Cau Truc D Lieu va Giai Thuat

1. Tam quan trong cua Cau truc d lieu va Giai thuat trong mot e an tin hoc
1.1. Xay dng Cau truc d lieu
1.2. Xay dng Giai thuat
1.3. Moi quan he gia Cau truc d lieu va Giai thuat
2. anh gia Cau truc d lieu va Giai thuat
2.1. Cac tieu chuan anh gia Cau truc d lieu
- Thi gian thc hien
- Mc o tieu ton bo nh
- Tnh thc te
2.2. anh gia o phc tap cua thuat toan
3. Kieu d lieu
3.1. Khai niem ve Kieu d lieu
T = {V, O}
3.2. Cac kieu d lieu c s
- Nguyen
- Thc
- Ky t
3.3. Cac kieu d lieu co cau truc
- Mang
- Cau truc (struct)
3.4. Kieu d lieu con tro
T * Pt;
3.5. Kieu d lieu tap tin
FILE * Fp;
int Fh;
Chng 2: Ky thuat tm kiem (Searching)

1. Khai quat ve tm kiem
2. Cac giai thuat tm kiem noi (tm kiem tren day)
2.1. Tm tuyen tnh (Linear Search)
Duyet t au en cuoi mang e tm
2.2. Tm nh phan (Binary Search)
Duyet tng na cac phan t, ch ap dung cho mang a co th t.
3. Cac giai thuat tm kiem ngoai (tm kiem tren tap tin)
3.1. Tm tuyen tnh (Linear Search)
Duyet t au en cuoi file e tm
3.2. Tm kiem theo ch muc (Index Search)
Duyet t au en tap tin ch muc e lay d lieu trong tap tin d lieu.
Chng 3: Ky thuat sap xep (Sorting)

1. Khai quat ve sap xep
2. Cac phng phap sap xep noi (sap xep day)
Trang: 224
2.1. Sap xep bang phng phap oi cho (Exchange)
- Noi bot (Bubble Sort)
- Phan hoach (Quick Sort)
2.3. Sap xep bang phng phap chon (Selection)
Chon trc tiep (Straight Selection Sort)
2.4. Sap xep bang phng phap chen (Insertion)
- Chen trc tiep (Straight Insertion Sort)
2.5. Sap xep bang phng phap tron (Merge)
- Tron trc tiep (Straight Merge Sort)
- Tron t nhien (Natural Merge Sort)
3. Cac phng phap sap xep ngoai (sap xep tap tin)
3.1. Sap xep bang phng phap tron
- Tron trc tiep (Straight Merge Sort)
- Tron t nhien (Natural Merge Sort)
3.2. Sap xep theo ch muc
Chng 4: Danh sach (List)

1. Khai niem ve danh sach
2. Cac phep toan tren danh sach
3. Danh sach ac (Condensed List)
3.1. nh ngha
3.2. Bieu dien va Cac thao tac
const int MaxLen = 10000; // hoac: #define MaxLen 10000
int Length;
T CD_LIST[MaxLen]; // hoac: T * CD_LIST = new T[MaxLen];
3.3. u nhc iem va ng dung
4. Danh sach lien ket (Linked List)
4.1. nh ngha
4.2. Danh sach lien ket n (Singly Linked List)
{ T Key;
SLL_Node * NextNode;
} SLL_OneNode;
typedef SLL_OneNode * SLL_Type;
4.3. Danh sach lien ket kep (Doubly Linked List)
{ T Key;
DLL_Node * NextNode;
DLL_Node * PreNode;
} DLL_OneNode;
typedef DLL_OneNode * DLL_Type;
4.4. u nhc iem cua danh sach lien ket
5. Danh sach han che
5.1. Hang i (Queue)
typedef struct Q_C
Trang: 225
{ int Len; // Chieu dai hang i
int Front, Rear;
T * List; // Noi dung hang i
} C_QUEUE;
C_QUEUE CQ_List;
5.2. Ngan xep (Stack)
typedef struct S_C
{ int Size; // Kch thc ngan xep
int SP;
T * List; // Noi dung ngan xep
} C_STACK;
C_STACK CS_List;
Chng 5: Cay (Tree)

1. Cac khai niem
2. Cay nh phan (Binary tree)
2.1. nh ngha
2.2. Bieu dien va Cac thao tac
typedef struct BinT_Node
{ T Key;
BinT_Node * BinT_Left;
BinT_Node * BinT_Right;
} BinT_OneNode;
typedef BinT_OneNode * BinT_Type;
2.3. Cay nh phan tm kiem (Binary Searching Tree)
typedef struct BST_Node
{ T Key;
BST_Node * BST_Left;
BST_Node * BST_Right;
} BST_OneNode;
typedef BST_OneNode * BST_Type;
3. Cay can bang (Balanced tree)
3.1. nh ngha
typedef struct BAL_Node
{ T Key;
int Bal;
BAL_Node * BAL_Left;
BAL_Node * BAL_Right;
} BAL_OneNode;
typedef BAL_OneNode * BAL_Type;
3.2. Cac thao tac
Trang: 226
Cau hoi va Bai tap on tap tong hp
1. Phan biet ve cau truc d lieu, y ngha va tac dung gia: danh sach lien ket oi, danh
sach a lien ket co hai moi lien ket va cay nh phan?
2. Hay s dung cau truc d lieu thch hp e lu tr cac so nguyen co dau co gia tr
tuyet oi qua ln trong bo nh trong cua may tnh. Vi cau truc d lieu nay, hay
trnh bay thuat toan va cai at chng trnh thc hien viec cong, tr, nhan, chia
nguyen, lay d, so sanh cac so nguyen co gia tr ln nay.
3. Hay s dung cau truc d lieu thch hp e lu tr o dai ng i gia cac Thanh
pho vi nhau trong mot quoc gia vao trong bo nh trong cua may tnh. Vi cau truc
d lieu nay, hay trnh bay thuat toan va cai at chng trnh thc hien viec liet ke tat
ca cac ng i t Thanh pho A en Thanh pho B? ng i nao la ng i ngan
nhat?
4. Cac van ban c lu tr thanh tng dong tren cac file van ban, moi dong co chieu
dai khong qua 127 ky t. Hay e xuat cau truc d lieu thch hp e lu tr trong bo
nh trong cua may tnh tan suat xuat hien cua cac t trong tap tin van ban nay. Vi
cau truc d lieu nay, hay trnh bay thuat toan va cai at chng trnh thc hien viec
thong ke xem cac t trong file van ban xuat hien vi tan suat nh the nao? Cho biet
van ban co bao nhieu t, bao nhieu ten t?
5. Cac van ban c lu tr thanh tng dong tren cac file van ban, moi dong co chieu
dai khong qua 127 ky t. Hay e xuat cau truc d lieu thch hp e lu tr trong bo
nh trong cua may tnh cac dong van ban trong tap tin van ban nay (co the bo nh
khong u e lu toan bo noi dung tap tin van ban nay vao trong bo nh trong cua
may tnh). Vi cau truc d lieu nay, hay trnh bay thuat toan va cai at chng trnh
thc hien viec hien noi tap tin van ban nay theo tng trang man hnh sao cho chung
ta co the s dung cac phm PgUp/PgDn e lat len/xuong theo tng trang man hnh va
s dung cac phm Up-arrow/Down-arrow e cho troi len/xuong tng dong van ban
tren man hnh? Cho biet van ban co bao nhieu dong?
6. Hay s dung cau truc d lieu thch hp e lu tr cac ma tran tha (ma tran ma chu
yeu gia tr cac phan t bang 0) trong bo nh trong cua may tnh. Vi cau truc d lieu
nay, hay trnh bay thuat toan va cai at chng trnh thc hien viec cong, tr, nhan
hai ma tran tha vi nhau, tao ma tran tha chuyen v t mot ma tran tha khac.
7. Hay s dung cau truc d lieu thch hp e lu tr Gia pha cua mot dong ho nao o
trong bo nh trong cua may tnh. Vi cau truc d lieu nay, hay trnh bay thuat toan
va cai at chng trnh thc hien viec kiem tra xem 02 ngi co ten la X va Y co
phai la hai anh em ruot hay khong? Neu khong phai th ai co vai ve cao hn? Gia
s rang moi cap v chong co khong qua 05 ngi con.
8. Hay s dung cau truc d lieu thch hp e lu tr mot he thong Menu co nhieu muc
chon, nhieu cap trong bo nh trong cua may tnh. Vi cau truc d lieu nay, hay trnh
bay thuat toan va cai at chng trnh thc hien viec cho menu xuat hien tren man
hnh va cho phep ngi s dung chon mot chc nang nao o cua menu.
9. Ket hp cau truc d lieu trong bai tap va 4, 5 va 8. Hay trnh bay thuat toan va cai
at chng trnh thc hien cac chc nang cua mot phan mem soan thao van ban
n gian?
Trang: 227
10. Hay s dung cau truc d lieu thch hp e lu tr cac t cua mot t ien vao trong
tap tin co ten DICT.DAT. Thong tin giai ngha ve mot t bao gom: Ten t, Loai t
(Danh t, ong t, tnh t, ), ngha tieng Viet.
a) S dung tap tin ch muc e liet ke cac t theo th t Alphabet (A -> Z).
b) Hay e xuat cau truc d lieu thch hp e lu tr trong bo nh trong cua may tnh
thong tin giai ngha cua cac t trong tap tin DICT.DAT nay (co the bo nh khong
u e lu toan bo noi dung tap tin DICT.DAT nay vao trong bo nh trong cua may
tnh). Vi cau truc d lieu nay, hay trnh bay thuat toan va cai at chng trnh
thc hien viec tra ngha cho mot t. Ngoai ra, ta co the s dung cac phm
PgUp/PgDn e lat len/xuong theo tng trang (do mnh quy nh) man hnh va s
dung cac phm Up-arrow/Down-arrow e cho troi len/xuong tng t tren man
hnh? S dung cau truc d lieu thch hp e lu tr trong bo nh trong cac t a
c tra ngha.
11. Ngi ta lu tr cac he so cua mot a thc bac n thanh cac dong van ban trong file
DATHUC.DAT theo nguyen tac: Moi dong la he so va so mu cua 1 a thc va cac he
so va so mu nay cach nhau t nhat la mot khoang trang.
Hay s dung cau truc d lieu thch hp e lu tr mot a thc vao trong bo nh
trong cua may tnh. Vi cau truc d lieu nay, hay trnh bay thuat toan va cai at
chng trnh thc hien cac cong viec sau:
- Xuat cac a thc trong file DATHUC.DAT ra man hnh;
- Tnh a thc tong, a thc hieu cua cac a thc nay;
- Tnh a thc tch cua cac a thc nay.
12. Mot hnh vuong co o dai canh la a c to 02 mau: trang va en. Ngi ta tien
hanh chia hnh vuong nay thanh 04 hnh vuong con eu nhau va ghi nhan v tr cua
chung trong hnh vuong ln. Neu trong moi hnh vuong con ch gom toan mau trang
hoac mau en th gi nguyen, con neu trong hnh vuong con con co 02 mau th tiep
tuc chia hnh vuong con nay thanh 04 hnh vuong con nho hn va ghi nhan v tr, ,
c nh vay sau mot so hu han phep chia se ket thuc viec chia. Hay s dung cau
truc d lieu thch hp e lu tr cac hnh vuong nay vao trong bo nh trong cua may
tnh. Vi cau truc d lieu la chon, hay trnh bay thuat toan va cai at chng trnh
thc hien cac cong viec sau:
- Tnh tong so hnh vuong tao thanh qua cac lan chia.
- Tnh tong so hnh vuong mau trang, mau en va tong dien tch tng ng cua
chung.
- Tai tao lai hnh vuong ban au.
13. nh ngha cau truc d lieu thch hp e lu tr cac gia tr trong tam giac Pascal
vao trong bo nh trong cua may tnh. Vi cau truc d lieu nay hay trnh bay thuat
toan va viet chng trnh thc hien cac cong viec sau:
- In tam giac Pascal co N dong ra man hnh.
- In va tnh gia tr bieu thc (a+b)N ra man hnh.
14. Trnh bay thuat toan va viet chng trnh thc hien cong viec minh hoa (Demo) qua
trnh thc hien tat ca cac thuat toan a hoc.
Trang: 228
IV. HNG DAN S DUNG TAI LIEU THAM KHAO

1. Cau truc d lieu
Tac gia: Nguyen Trung Trc
Khoa CNTT, trng HBK TP.HCM
2. Giao trnh Cau truc d lieu 1
Tac gia: Tran Hanh Nhi Dng Anh c
Khoa CNTT, trng HKHTN HQG TP.HCM
3. Algorithms + Data Structures = Programs
Tac gia: N.Wirth
NXB: Prentice Hall, 1976
4. Data Structures and Algorithms
Tac gia: Alfred V.Aho - John E.Hopcroft Jeffrey D.Ullman
NXB: Addison-Wesley Publishing Company
5. Algorithms (Second Edition)
Tac gia: Robert Sedgewick
NXB: Addison-Wesley Publishing Company
6. Data Structures and Program Design (Third Edition)
Tac gia: Robert L.Kruse
NXB: Prentice Hall
Trang: 229

Data Structure and Algorithms - Ebook PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Structure and Algorithms - Ebook PDF

Uploaded by

Copyright:

Available Formats

MUC LUC

CHNG 2: KY THUAT TM KIEM (Searching) .............................8

CHNG 3: KY THUAT SAP XEP (SORTING) .............................19

CHNG 5: CAY (TREE) ............................................................... 149

ON TAP (REVIEW).......................................................................... 224

TAI LIEU THAM KHAO ................................................................. 229

By Ht thuc l c hi cho sc khe at 9:19 pm, Jun 25, 2007

Chng 1: TONG QUAN VE CAU TRUC D LIEU VA GIAI THUAT

1.1.1. Xay dng cau truc d lieu

1.1.2. Xay dng giai thuat

1.1.3. Moi quan he gia cau truc d lieu va giai thuat

1.2. anh gia cau truc d lieu va giai thuat

By Ht thuc l c hi cho sc khe at 9:19 pm, Jun 25, 2007

1.2.2. anh gia o phc tap cua thuat toan

1.3. Kieu d lieu

1.3.1. Khai niem ve kieu d lieu

Kieu d lieu T co the xem nh la s ket hp cua 2 thanh phan:

1.3.2. Cac kieu d lieu c s

1.3.3. Cac kieu d lieu co cau truc

1.3.4. Kieu d lieu con tro

1.3.5. Kieu d lieu tap tin

Chng 2: KY THUAT TM KIEM (SEARCHING)

2.1. Khai quat ve tm kiem

2.2.2. Tm tuyen tnh (Linear Search)

c. Cai at thuat toan:

d. Phan tch thuat toan:

e. Cai tien thuat toan:

f. Phan tch thuat toan cai tien:

2.2.3. Tm nh phan (Binary Search)

b. Thuat toan e quy (Recursion Algorithm):

c. Cai at thuat toan e quy:

d. Phan tch thuat toan e quy:

e. Thuat toan khong e quy (Non-Recursion Algorithm):

g. Phan tch thuat toan khong e quy:

2.3.2. Tm tuyen tnh

c. Cai at thuat toan:

d. Phan tch thuat toan:

c. Cai at thuat toan:

d. Phan tch thuat toan:

Cau hoi va Bai tap

Chng 3: KY THUAT SAP XEP (SORTING)

3.1. Khai quat ve sap xep

a. Thuat toan sap xep noi bot (Bubble Sort):

Sau 9 lan i mang M tr thanh:

b. Thuat toan sap xep da tren s phan hoach (Partitioning Sort):

Phan hoach cac phan t trong day con t I -> Last:

Phan hoach cac phan t trong day con t I -> Last:

Phan hoach cac phan t trong day con t I -> Last:

Toan bo qua trnh phan hoach ket thuc, day M tr thanh:

- Phan tch thuat toan:

Lan 2: Min = 2 PosMin = 3 K=1

Lan 3: Min = 5 PosMin = 7 K=2

Lan 5: Min = 20 PosMin = 10 K = 4

Lan 6: Min = 25 PosMin = 10 K = 5

Lan 7: Min = 30 PosMin = 8 K=6

Lan 8: Min = 33 PosMin = 9 K=7

Lan 9: Min = 45 PosMin = 10 K = 8

Sau lan 9: K = 9 va mang M tr thanh:

- Phan tch thuat toan:

3.2.3. Sap xep bang phng phap chen (Insertion Sort)

Lan 4: K = 4 X = M[K+1] = M[5] = 51 Pos = 4

Lan 5: K = 5 X = M[K+1] = M[6] = 54 Pos = 5

Lan 7: K = 7 X = M[K+1] = M[8] = 73 Pos = 7