MOT SO THUAT TOAN TRONG C

1.Cac thut toan sp xp

1.1. Thut toan selection sort
a) Thut toan :
B1- Tim gia tri nho nht trong dy
B2- Di ch no voi gia tri o vi tri du tin
B3-Lp lai 2 buoc ( voi dy bt du tu phn tu thu 2).
b) Cai dt
















//Sap xep Lheo SelecLlon sorL
vold SelecLSorL(lnL alnL n)

for (lnL l0 ln l++)

for (lnL [l+1 [n [++)

lf (ala[)

swap(ala[)




c) D phuc tap:
D phuc tap cua Selection Sort la O(n
2
)
CM: Ham O(n
2
) co nghia rng ,di voi cac gia tri lon hon n,s ln lp lai cua vong lp co
khuynh huong ti l n
2
. Diu do co nghia rng ,nu mt mang luon gp di kich c cua
mt mang khac,no s mt mt khoang thoi gian gp 4 ln d thuc hin vic phn loai.
O ln lp du tin cua vong lp i bn ngoai,vong lp j bn trong lp n-1 ln.
O ln lp thu 2,no lp n-2 ln.Tin trinh nay tip tuc cho ra tng s :
(n-1)(n-2)....21 n(n-1)/2
D phuc tap cua Selection Sort ging voi Bubble Sort
d) Minh hoa:
64 25 12 22 11 min=11

11 25 12 22 64 di ch min v 64

11 12 25 22 64 min=12

11 12 22 25 64 min=22

11 12 22 25 64 min=25

1.2. Thut toan insertion sort
a) Thut toan :
Insertion Sort la mt cach ph bin duoc nguoi ta su dung d phn loai cac la bai duoc
chia cho ho khi choi bai.Khng ging nhu bubble sort va Quick sort,insertion sort khng
su dung ham swap().Thay vao do ,no dich chuyn cac phn tu d tao khoang trng cho
mi phn tu moi duoc dua vao.O ln lp thu i cua vong lp chinh,tt ca cac phn tu bn
trai cua a|i| nho hon a|i| duoc dich chuyn mt vi tri sang bn phai,tao khoang trng d
chen a|i| vao vi tri dung cua no so voi i-1 phn tu d duoc xu ly truoc do

b) Cai dt










c) D phuc tap:
D phuc tap cua insertion sort la O(n
2
).
CM:
O ln lp du tin cua vong lp i bn ngoai,vong lp j bn trong lp lai mt ln.
O ln lp thu 2,no lp lai mt hay hai ln ,tuy thuc a|1|~a|2| hay khng.
O ln lp thu 3,vong lp i bn trong lp lai ti da ba ln tuy thuc vao s luong phn tu o
bn trai cua a|3| va lon hon a|3|.Cach nay tip tuc,d o ln lp thu k cua vong lp bn
ngoai ,vong lp bn trong lp lai ti da k ln.Do do,tng s ln lp la :
1234..(n-2)(n-1)n(n/2).
**Nu mang d duoc phn loai thi Insertion sort co d phuc tap la O(n)
CM: Trong truong hop nay,vong lp bn trong chi lp lai mt ln di voi mi ln lp bn
ngoai,vi vy tng s ln lp cua vong lp bn trong la :
111..11n-1
Thut toan co d phuc tap O(n) goi la tuyn tinh.


vold lnserLSorL(lnL alnL n)

lnL l[Lemp
for (l1lnl++)

Lempal
[l1
whlle (Lempa[[0)

a[+1a[
[[1

a[+1Lemp


1.3. Thut toan Bubble Sort
a) Thut toan:
Trong thut toan sp xp ni bot dy duoc duyt tu du dy dn cui dy. Xet 2
phn tu dung cn k nhau, nu phn tu dung truoc lon hon phn tu dung sau thi
di ch cho nhau. Sau ln duyt nhu vy phn tu lon nht trong dy khoa s
chuyn v vi tri cui cung . Ta khng xet phn tu a
n
nua ma sp xp tu phn tu a
0

dn phn tu a
n-1
.

b) Cai dt


vold 8ubbleSorL(lnL alnL n)

lnL l[
for (l0ln1l++)

for ([0 [nl [++)

lf (a[1a[)

swap(a[1a[)







c) D phuc tap
D phuc tap cua thut toan la O(n
2
).
1.4. Thut toan Merge Sort
a) Thut toan:
Merge Sort la thut toan d quy.No thuc hin bng cach chia mang thanh cac mang con
gm hai phn tu duoc phn loai,kt hop voi chung theo cp thanh cac mang con gm bn
phn tu phn loai,kt hop voi chung thanh cac mang gm 8 phn tu duoc phn loai...,cho
dn khi chi co hai mang con d duoc phn loai duoc kt hop.Sau ln kt hop cui cung
do chi con lai mt mang con duy nht duoc phn loai.
D dang nhn thy thut toan Merge Sort phuc tap hon so voi ba thut toan truoc. No co
tinh cht d quy va su dung mt ham phu co bn vong lp ring bit.Nhung cac yu t
nay tao ra mt thut toan nhanh hon nhiu so voi cac thut toan kia.



b) Cai dt
c) D phuc tap
1.5.
1.6. Thut toan inte