LOGO

PHN TCH THUT TON

CHNG 2
Algorithm Analysis
n tp
Tnh T(n) ?
2
sum = 0;
i = 1;
while (i s n) do
j = 1;
while (j s n) do
sum = sum + i*j;
j = j + 1;
end do;
i = i +1;
end do;
S php gn ?
S php so snh ?
n tp
Tnh s php gn
3
sum = 0;
i = 1;
while (i s n) do
j = 1;
while (j s n) do
sum = sum + i*j;
j = j + 1;
end do;
i = i +1;
end do;
1g
1g
1g
1g
2n g
1g
1g
n(2n+2) g
Gan = 2n
2
+2n + 2
n tp
Tnh s php so snh
4
sum = 0;
i = 1;
while (i s n) do
j = 1;
while (j s n) do
sum = sum + i*j;
j = j + 1;
end do;
i = i +1;
end do;
n+1 ss
(n)(n+1) + (n+1) ss
So snh = n
2
+2n + 1
n tp
Tnh T(n) ?
5
sum = 0;
i = 1;
while (i s n) do
j = 1;
while (j s n) do
sum = sum + i*j;
j = j + 1;
end do;
i = i +1;
end do;
T(n) =3n
2
+ 4n + 3
T(n) =O(n
2
)
Ni dung
6
THUT TON
KHNG QUY QUY
-Phng php
-V d
-Tm phng trnh quy
-Kh quy
Mt s thut ton thng dng
Ni dung
7
THUT TON
KHNG QUY QUY
-Phng php
-V d
-Tm phng trnh quy
-Kh quy
Mt s thut ton thng dng
Thut ton khng quy Phng php
Thi gian thc hin chng trnh ph
thuc vo
kch thc d liu
tnh cht ca d liu
Cc trng hp phn tch thut ton
Trng hp tt nht
Trng hp trung bnh
Trng hp xu nht
8
Thut ton khng quy Phng php
Qui tc nh gi T(n)
Cho T
1
(n) v T
2
(n) l thi gian thc hin ca hai on
chng trnh P
1
v P
2
T
1
(n) = O(f(n)) T
2
(n) = O(g(n))
Qui tc cng: Thi gian thc hin ca hai on
chng trnh P
1
v P
1
ni tip nhau l
T(n) = O(max(f(n), g(n)))
Qui tc nhn: Thi gian thc hin ca hai on
chng trnh P
1
v P
2
lng nhau l
T(n) = O(f(n)*g(n))
9
Thut ton khng quy Phng php
V d
10
sum = 0;
for(i= 0; i < n; i++)
sum = sum + i;
return sum;
P
1
P
2
P
3
Ni tip nhau
T(n) = O(max(f(n), g(n), h(n)))
Thut ton khng quy Phng php
V d
11
for(i= 0; i < n; i++)
if (a[max] < a[i])
max = i;
P
1
P
2
Lng nhau
T(n) = O((f(n)*g(n)))
Thut ton khng quy Phng php
V d
12
sum = 0;
for(i= 0; i < n; i++)
sum = sum + i;
return sum;
P
1
P
2
P
3
T(n) = O(max(1, n, 1)) = O(n)
T
1
(n) = O(1)
T
3
(n) = O(1)
T
3
(n) = O(n.1) = O(n)
Thut ton khng quy Phng php
Cch tm T(n) ?
13
if (<iu kin>)
{
Thc hin;
}
else
{
Thc hin ;
}
Thut ton khng quy V d
Khng ph thuc tnh cht d liu vo
V d 1:
14
sum = 0;
i = 1;
while (i s n) do
j = 1;
while (j s n) do
sum = sum + i*j;
j = j + 1;
end do;
i = i +1;
end do;
Thut ton khng quy V d
V d 1:
15
/*1*/ sum = 0;
/*2*/ i = 1;
/*3*/ while (i s n) do
/*4*/ j = 1;
/*5*/ while (j s n) do
/*6*/ sum = sum + i*j;
/*7*/ j = j + 1;
end do;
/*8*/ i = i +1;
end do;
Lnh {6}, {7} tn O(1)
Vng lp {5} thc hin n ln, mi ln
l O(1), nn {5} tn O(n.1) = O(n)
Lnh {4}, {8} tn O(1)
Lnh {4}, {5}, {8} ni tip nhau, nn
thi gian thc hin l O(max(1, n, 1)) =
O(n)
Vng lp {3} thc hin n ln, mi ln
l O(n), nn {3} tn O(n.n) = O(n
2
)
Lnh {1}, {2} tn O(1)
Lnh {1}, {2}, {3} ni tip nhau nn
T(n) = O(max(1, 1, n
2
)) = O(n
2
)
Thut ton khng quy V d
Khng ph thuc tnh cht d liu vo
V d 2:
16
s = 0;
i = 1;
while (i s n) do
j = n i;
while (j > 1) do
s = s + 1;
j = j 1;
end do;
i = i +1;
end do;
Thut ton khng quy V d
V d 2:
17
/*1*/ s = 0;
/*2*/ i = 1;
/*3*/ while (i s n) do
/*4*/ j = n i;
/*5*/ while (j > 1) do
/*6*/ s = s + 1;
/*7*/ j = j 1;
end do;
/*8*/ i = i +1;
end do;
Lnh {6}, {7} tn O(1)
Vng lp {5} thc hin n-i ln, mi ln l
O(1), nn {5} tn O((n-i).1) = O(n-i)
Lnh {4}, {8} tn O(1)
Lnh {4}, {5}, {8} ni tip nhau, nn thi
gian thc hin l O(max(1, n-i, 1)) = O(n-i)
Vng lp {3} c i chy t 1 n, mi ln l
O(n-i), nn {3} tn
Lnh {1}, {2} tn O(1)
Lnh {1}, {2}, {3} ni tip nhau nn T(n) =
O(max(1, 1, n
2
)) = O(n
2
)
2
2
1
( 1)
( ) ( )
2 2
n
i
n n n n
n i O n
=

= = =

Thut ton khng quy V d

Ph thuc tnh cht d liu vo
V d 1:
18
i = 1;
max = A[0];
while (i < n) do
if (max < A[i]) then
max = A[i];
end if;
i = i +1;
end do;
Thut ton khng quy V d
V d 1:
19
/*1*/ i = 1;
/*2*/ max = A[0];
/*3*/ while (i < n) do
/*4*/ if (max < A[i]) then
/*5*/ max = A[i];
end if;
/*6*/ i = i +1;
end do;
Lnh {5} tn O(1)
Vic so snh max < A[i] tn O(1)
Lnh {4} tn O(1)
Lnh {6} tn O(1)
Lnh {4}, {6} ni tip nhau, nn thi
gian thc hin l O(max(1, 1)) = O(1)
Vng lp {3} thc hin n-1 ln, mi ln
l O(1) nn {3} tn O((n-1).1) = O(n-1)
Lnh {1}, {2} tn O(1)
Lnh {1}, {2}, {3} ni tip nhau nn
T(n) = O(max(1, 1, n-1)) = O(n-1)=O(n)
Thut ton khng quy V d
Ph thuc tnh cht d liu vo
V d 2:
20
i = 1;
max = A[0];
count = 0;
while (i s n) do
if (max < A[i]) then
max = A[i];
else
count = count +1;
end if;
i = i +1;
end do;
Thut ton khng quy V d
V d 2:
21
/*1*/ i = 1;
/*2*/ max = A[0];
/*3*/ count = 0;
/*4*/ while (i s n) do
/*5*/ if (max < A[i]) then
/*6*/ max = A[i];
/*7*/ else
/*8*/ count = count +1;
end if;
/*9*/ i = i +1;
end do;
Lnh {6}, {8} tn O(1) thi gian
tn ln nht l O(1)
Vic so snh max < A[i] tn O(1)
Lnh {5} tn O(1)
Lnh {9} tn O(1)
Lnh {5}, {9} ni tip nhau, nn thi
gian thc hin l O(max(1, 1)) = O(1)
Vng lp {4} thc hin n ln, mi ln
l O(1) nn {3} tn O((n).1) = O(n)
Lnh {1}, {2}, {3} tn O(1)
Lnh {1}, {2}, {3}, {4} ni tip nhau
nn T(n) = O(max(1, 1, 1, n)) = O(n)
Ni dung
22
THUT TON
KHNG QUY QUY
-Phng php
-V d
-Tm phng trnh quy
-Kh quy
Mt s thut ton thng dng
Khi nim quy
Cho S(n) = 1 + 2 + 3 + + n
=>S(10)? S(11)?
1 + 2 + + 10
1 + 2 + + 10
= 55
+ 11 = 66 1 + 2 + + 10
=
=
S(10)
S(11)
1 + 2 + + 10
S(10) = + 11
= + 11 55 = 66
S(10)
+ 11
55
+ 11
23
2 bc gii bi ton quy
=
S(n)
+
n S(n-1)
=
S(n-1)
+
n-1 S(n-2)
=

+

=
S(1)
+
1 S(0)
=
S(0) 0
Bc 1. Phn tch
Phn tch thnh bi ton ng
dng nhng n gin hn.
Dng li bi ton ng
dng n gin nht c th xc
nh ngay kt qu.
Bc 2. Th ngc
Xc nh kt qu bi ton
ng dng t n gin n
phc tp Kt qu cui cng.
24
Khi nim quy
Khi nim
Vn quy l vn c
nh ngha bng chnh n.
V d
Tng S(n) c tnh thng qua
tng S(n-1).
2 iu kin quan trng
Tn ti bc quy.
iu kin dng.
25
Hm quy trong NNLT C
Khi nim
Mt hm c gi l quy nu bn trong
thn ca hm c li gi hm li chnh n
mt cch trc tip hay gin tip.
Hm()
{

Li gi Hm

}
Q trc tip
Hm1()
{

Li gi Hm2

}
Q gin tip
Hm2()
{

Li gi Hmx

}
26
Cu trc hm quy
{
if (<K dng>)
{

return <Gi tr>;

}

Li gi Hm

}
<Kiu> <TnHm>(TS)
Phn dng
(Base step)
Phn khi tnh ton hoc
im kt thc ca thut ton
Khng cha phn ang c
nh ngha
Phn quy
(Recursion step)
C s dng thut ton ang
c nh ngha.
27
Phn loi
2
TUYN TNH
NH PHN
H TNG
PHI TUYN
1
3
4
Trong thn hm c duy nht mt
li gi hm gi li chnh n mt
cch tng minh.
Trong thn hm c hai li gi
hm gi li chnh n mt cch
tng minh.
Trong thn hm ny c li gi hm ti
hm kia v bn trong thn hm kia c
li gi hm ti hm ny.
Trong thn hm c li gi hm li chnh
n c t bn trong thn vng lp.
28
<Kiu> TnHm(<TS>) {
if (<K ng>) {

return <Gi Tr>;

}
TnHm(<TS>);
}
Cu trc chng trnh
quy tuyn tnh
Tnh S(n) = 1 + 2 + + n
S(n) = S(n 1) + n
K dng: S(0) = 0
V d
29
.: Chng trnh :.
long Tong(int n)
{
if (n == 0)
return 0;
return Tong(n1) + n;
}
<Kiu> TnHm(<TS>) {
if (<K dng>) {

return <Gi Tr>;

}
TnHm(<TS>);

TnHm(<TS>);

}
Cu trc chng trnh
quy nh phn
Tnh s hng th n ca dy
Fibonacy:
f(0) = f(1) = 1
f(n) = f(n 1) + f(n 2) n > 1
K dng: f(0) = 1 v f(1) = 1
V d
30
.: Chng trnh :.
long Fibo(int n)
{
if (n == 0 || n == 1)
return 1;
return Fibo(n1)+Fibo(n2);
}
<Kiu> TnHm1(<TS>) {
if (<K dng>)
return <Gi tr>;
TnHm2(<TS>);
}
<Kiu> TnHm2(<TS>) {
if (<K dng>)
return <Gi tr>;
TnHm1(<TS>);
}
Cu trc chng trnh
quy h tng
Tnh s hng th n ca dy:
x(0) = 1, y(0) = 0
x(n) = x(n 1) + y(n 1)
y(n) = 3*x(n 1) + 2*y(n 1)
K dng: x(0) = 1, y(0) = 0
V d
31
.: Chng trnh :.
long yn(int n);
long xn(int n) {
if (n == 0) return 1;
return xn(n-1)+yn(n-1);
}
long yn(int n) {
if (n == 0) return 0;
return 3*xn(n-1)+2*yn(n-1);
}
<Kiu> TnHm(<TS>) {
if (<K dng>) {

return <Gi Tr>;

}
Vng lp {
TnHm(<TS>);
}

}
Cu trc chng trnh
quy phi tuyn
Tnh s hng th n ca dy:
x(0) = 1
x(n) = n
2
x(0) + (n-1)
2
x(1) +
+ 2
2
x(n 2) + 1
2
x(n 1)
K dng: x(0) = 1
V d
32
.: Chng trnh :.
long xn(int n)
{
if (n == 0) return 1;
long s = 0;
for (int i=1; i<=n; i++)
s = s + i*i*xn(ni);
return s;
}
V d
V d
Vi trng c 1 gi li nhn i. Vy sau 5 gi
s c my con vi trng nu ban u c 2 con?
33
Gii php
Gi V
h
l s vi trng ti thi
im h.
Ta c:
V
h
= 2V
h-1
V
0
= 2
quy tuyn tnh vi
V(h)=2*V(h-1) v iu kin
dng V(0) = 2
int vitrung(int n)
{
if (n == 0)
return 2;
return 2*vitrung(n-1);
}
Phn tch thut ton quy
Cch 1:
Thnh lp phng trnh quy
Gii phng trnh quy
Thi gian thc hin chng trnh = nghim ca
phng trnh quy
Cch 2:
Kh quy Thut ton khng quy
34
Phn tch thut ton quy
Thnh lp phng trnh quy
Phng trnh qui l mi quan h gia T(n) v
T(k), vi T(n) v T(k) l thi gian thc hin
chng trnh c kch thc d liu l n, k (k s n)
Trng hp dng: thi gian thc hin l C(n)
Gi qui C bao nhiu li gi qui c kch
thc k ta s c by nhiu T(k)
Ngoi ra, thi gian tng hp bi ton f(n)
35
Phn tch thut ton quy
Thnh lp phng trnh quy
Dng tng qut ca phng trnh qui
C(n): thi gian thc hin chng trnh trong
trng hp dng
g(T(k)) l a thc ca T(k)
f(n) l thi gian phn chia/kt hp cc kt qu
36

+
=
) ( )) ( (
) (
) (
n f k T g
n C
n T
Phn tch thut ton quy
Thnh lp phng trnh quy
V d: Vi trng c 1 gi li nhn i. Vy sau 5 gi s c
my con vi trng nu ban u c 2 con?
37
int vitrung(int n)
{
if (n == 0)
return 2;
return 2*vitrung(n-1);
}
Khi n = 0, chng trnh thc hin
lnh return nn tn O(1) do ta c
T(0) = C
1
Khi n > 0, gi qui tnh vitrung(n
1) nn thi gian thc hin l T(n-1).
Thi gian nhn cc kt qu li vi
nhau l C
2
T(n) l thi gian tnh n!
T(n - 1) l thi gian tnh (n-1)!
Phn tch thut ton quy
Thnh lp phng trnh quy
V d: Vi trng c 1 gi li nhn i. Vy sau 5 gi s c
my con vi trng nu ban u c 2 con?
38
int vitrung(int n)
{
if (n == 0)
return 2;
return 2*vitrung(n-1);
}
Khi n = 0, chng trnh thc hin
lnh return nn tn O(1) do ta c
T(0) = C
1
Khi n > 0, gi qui tnh vitrung(n
1) nn thi gian thc hin l T(n-1).
Thi gian nhn cc kt qu li vi
nhau l C
2

> +
=
=
0 ) 1 (
0
) (
2
1
n khi C n T
n khi C
n T
Phn tch thut ton quy
Thnh lp phng trnh quy
V d: Gi ngn hng 1000 USD, li sut 12%/nm. S
tin c c sau 30 nm l bao nhiu?
Gii php
Gi T
n
l s tin c c sau n nm.
Ta c:
T
n
= T
n-1
+ 0.12T
n-1
= 1.12T
n-1
V(0) = 1000
quy tuyn tnh vi T(n)=1.12*T(n-1) v iu kin
dng V(0) = 1000
39
Phn tch thut ton quy
Thnh lp phng trnh quy
V d: Gi ngn hng 1000 USD, li sut 12%/nm. S
tin c c sau 30 nm l bao nhiu?
40
int goitien(int n)
{
if (n == 0)
return 1000;
return 1.12*goitien(n-1);
}
Khi n = 0, chng trnh thc hin
lnh return nn tn O(1) do ta c
T(0) = C
1
Khi n > 0, gi qui tnh goitien(n1)
nn thi gian thc hin l T(n-1).
Thi gian nhn cc kt qu li vi
nhau l C
2

> +
=
=
0 ) 1 (
0
) (
2
1
n khi C n T
n khi C
n T
Phn tch thut ton quy
Thnh lp phng trnh quy
V d: Chng trnh tnh s Fibonacy
41
long Fibo(int n)
{
if (n == 0 || n == 1)
return 1;
return Fibo(n1)+Fibo(n2);
}
1
2
0 || 1
( )
( 1) ( 2) 1
C khi n n
T n
T n T n C khi n
= =

=

+ + >

Phn tch thut ton quy

Thnh lp phng trnh quy
V d: Tm phng trnh quy ca chng trnh sau:
42
1
2
1
( )
2 ( ) 1
2
C khi n
T n
n
T C khi n
=

=

+ >

public int g(int n) {

if (n == 1)
return 2;
else
return 3 * g(n / 2) + g( n / 2) + 5;
}
Phn tch thut ton quy
Thnh lp phng trnh quy
V d: Tm phng trnh quy ca chng trnh sau:
43
long xn(int n)
{
if (n == 0) return 1;
long s = 0;
for (int i=1; i<=n; i++)
s = s + i*i*xn(ni);
return s;
}
1
2 3
0
( )
( 1) 0
C khi n
T n
C nT n nC khi n
=

=

+ + >

Phn tch thut ton quy

Gii phng trnh quy
Phng php truy hi
Phng php on nghim
nh l Master
Phng php hm sinh
44
Phn tch thut ton quy
Gii phng trnh quy
Phng php truy hi
Phng php on nghim
nh l Master
Phng php hm sinh
45
Phn tch thut ton quy
Gii phng trnh quy- PP Truy hi
Dng quy thay th T(m) vo m < n
vo pha phi ca phng trnh cho n
khi tt c T(m) c thay th bi cc biu
thc T(1) hoc T(0).
T(1) v T(0) lun l hng s cng thc
T(n) cha cc s hng ch lin quan ti n
v hng s.
46
Phn tch thut ton quy
Gii phng trnh quy- PP Truy hi
V d
Qu trnh kt thc khi n-i = 0 i = n
Khi : T(n) = T(0) + nC
2
=O(n)
47

> +
=
=
0 ) 1 (
0
) (
2
1
n khi C n T
n khi C
n T
| |
| |
2
2 2 2
2 2 2
2
( ) ( 1)
( 2) ( 2) 2
( 3) 2 ( 3) 3
....
( )
T n T n C
T n C C T n C
T n C C T n C
T n i iC
= +
= + + = +
= + + = +
= +
Phn tch thut ton quy
Gii phng trnh quy- PP Truy hi
V d
Qu trnh kt thc khi
48
1
2
1
( )
2 ( ) 1
2
C khi n
T n
n
T nC khi n
=

=

+ >

2
2 2 2
2 2 2
2
( ) 2
2
2 2 4 2
4 2 4
4 2 2 8 3
8 4 8
.....
2
2
i
i
n
T n T nC
n n n
T C nC T nC
n n n
T C nC T nC
n
T inC
| |
= +
|
\ .
(
| | | |
= + + = +
| |
(
\ . \ .

(
| | | |
= + + = +
| |
(
\ . \ .

| |
= +
|
\ .
1 log
2
i
n
i n = =
Phn tch thut ton quy
Gii phng trnh quy- PP Truy hi
V d
Qu trnh kt thc khi
Khi :
49
1
2
1
( )
2 ( ) 1
2
C khi n
T n
n
T nC khi n
=

=

+ >

1 log
2
i
n
i n = =
( )
( )
2
log
2
log
2
1 2
2
2
2 log
2
(1) (log )
(log )
( log )
i
i
n
n
n
T n T inC
n
T n nC
nT n n C
nC n n C
O n n
| |
= +
|
\ .
| |
= +
|
\ .
= +
= +
=
Phn tch thut ton quy
Gii phng trnh quy- PP Truy hi
V d
50
1
2
0
( )
( 1) 0
C khi n
T n
T n n C khi n
=

=

+ + >

Phn tch thut ton quy

Gii phng trnh quy
Phng php truy hi
Phng php on nghim
nh l Master
Phng php hm sinh
51
Phn tch thut ton quy
Gii phng trnh quy- PP on nghim
Ta on mt nghim f(n) v dng chng
minh quy np chng t rng T(n) s
f(n), vi mi n
f(n) thng l mt trong cc hm quen
thuc nh logn, n, n
2
, n
3
, 2
n
, n!, n
n
i khi ta ch on dng ca f(n) trong
c vi tham s cha xc nh v trong qu
trnh quy np, ta s tm ra gi tr thch hp
cho cc tham s.
52
Phn tch thut ton quy
Gii phng trnh quy- PP on nghim
V d:
Ta on f(n) = a*n + b
n = 0, T(0) = C
1
v f(0) = b, mun T(0) s f(0) th
C
1
s b
Gi s T(k) s f(k), k < n. Ta cm T(n) s f(n), n
p dng gi thit quy np vi k = n-1 < n (n > 0)
53
1
2
0
( )
( 1) 0
C khi n
T n
T n C khi n
=

=

+ >

Phn tch thut ton quy

Gii phng trnh quy- PP on nghim
tm a, b, ta gii h:
Suy ra: b = C
1
, a = C
2
Ta c: T(n) s (C
2
)n + C
1
n
T(n) = O(n)
54
( ) ( )
2 2
2
2
( ) 1 1
( )
: 0
( ) ( )
T n T n C a n b C
T n an b C a
Gs C a
T n an b f n
= + s + +
s + +
s
s + =
1
2
b C
a C
>

>

Phn tch thut ton quy

Gii phng trnh quy- PP on nghim
V d:
Ta on f(n) = a*n*logn + b
n = 1, T(1) = C
1
v f(1) = b, mun T(1) s f(1) th
C
1
s b
Gi s T(k) s f(k), k < n. Ta cm T(n) s f(n), n
p dng gi thit quy np vi k = n/2 < n (n>1)
55
1
2
1
( )
2 ( ) 1
2
C khi n
T n
n
T nC khi n
=

=

+ >

Phn tch thut ton quy

Gii phng trnh quy- PP on nghim
56
( )
( ) ( )
( )
2 2
2
2
2
( ) 2 2 log
2 2 2
( ) log 2
( ) log
:
( ) log ( )
n n n
T n T nC a b nC
T n an n an b nC
T n an n b b C a n
Gs a C b
T n an n b f n
| | (
= + s + +
|
(
\ .
s + +
s + + + (

> +
s + =
Phn tch thut ton quy
Gii phng trnh quy- PP on nghim
tm a, b, ta gii h:
Suy ra: b = C
1
, a = C
1
+ C
2
Ta c: T(n) s (C
1
+ C
2
)nlogn + C
1
n
T(n) = O(nlogn)
57
1
2
b C
a C b
>

> +

Phn tch thut ton quy

Gii phng trnh quy
Phng php truy hi
Phng php on nghim
nh l Master
Phng php hm sinh
58
Phn tch thut ton quy
Gii phng trnh quy-nh l Master
nh l Master cho php c lng
nghim ca cc phng trnh quy c
dng:
vi a > 1, b > 1, c > 0, k > 1, h > 0
59
if 1
( )
if n >1
c
d n
T n
n
aT kn h
b
=

=
| |
+ +
|

\ .

Phn tch thut ton quy

Gii phng trnh quy-nh l Master
Chia bi ton kch thc n thnh a bi ton con,
mi bi ton con c kch thc n/b
Gii bi ton con
Tng hp kt qu
60
if 1
( )
if n >1
c
d n
T n
n
aT kn h
b
=

=
| |
+ +
|

\ .

Phn tch thut ton quy

Gii phng trnh quy-nh l Master
TH1:
TH2:
TH3:
61
( )
log ( )
( ) if
b
a c
T n O n a b = >
( )
( ) log if
c c
T n O n n a b = =
( )
( ) if
c c
T n O n a b = <
if 1
( )
if n >1
c
d n
T n
n
aT kn h
b
=

=
| |
+ +
|

\ .

Phn tch thut ton quy

Gii phng trnh quy-nh l Master
V d:
a = 4, b = 2, c = 2
a = b
c
TH2
62
2
1 if 1
( )
4 if 1
2
n
T n
n
T n n
=

=
| |
+ >
|

\ .

( ) ( )
2
( ) log log
c
T n O n n O n n = =
Phn tch thut ton quy
Gii phng trnh quy-nh l Master
V d:
a = 3, b = 4, c = 1/2
a > b
c
TH1
63
1 if 1
( )
3 if 1
4
n
T n
n
T n n
=

=
| |
+ >
|

\ .

( ) ( )
4
log ( ) log (3)
( )
b
a
T n O n O n = =
Phn tch thut ton quy
Gii phng trnh quy
Phng php truy hi
Phng php on nghim
nh l Master
Phng php hm sinh
nh ngha
p dng
64
Phn tch thut ton quy
Hm sinh
nh ngha:
Hm sinh ca dy v hn l chui ly
tha
K hiu:
65
{ }

=0 n
n
a
0
( )
n
n
n
f x a x

=
=

{ } ,... , ,
2 1 0
0
a a a a
n
n
=

=
2
0 1 2
0
( ) ...
n
n
n
f x a x a a x a x

=
= = + + +

Phn tch thut ton quy

Hm sinh
V d:
66
2
2
0, 0, 0,... ( ) 0 0. 0. ... 0
1, 0, 0,... ( ) 1 0. 0. ... 1
f x x x
f x x x
= + + + =
= + + + =
0
1
1 ( )
1
n
n
n
a f x x
x

=
= = =

( )
( ) 0
1
1 ( ) 1
1
n
n
n
a f x x
x

=
= = =
+

Phn tch thut ton quy

Hm sinh
V d:
67
( )
( )
2
0
1
( )
1
n
n
n
a n f x n x
x

=
= = =

( )
( )
2
0
1
1 ( ) 1
1
n
n
n
a n f x n x
x

=
= + = + =

Phn tch thut ton quy

Hm sinh
V d: Cho phng trnh sau:
Y/c: S dng hm sinh gii pt trn
68
(0) 1, (1) 9
( )
6 ( 1) 9 ( 2) 2
T T
T n
T n T n n
= =

=

>

0
( ) ( )
n
n
f x T n x

=
=

Phn tch thut ton quy

Hm sinh
69
(0) 1, (1) 9
( )
6 ( 1) 9 ( 2) 2
T T
T n
T n T n n
= =

=

>

0
( ) ( )
n
n
f x T n x

=
=
Ta c:
2
( ) ( ) (0) (1)
n
n
f x T n x T T x

=
= + +

| |
2
( ) 6 ( 1) 9 ( 2) 1 9
n
n
f x T n T n x x

=
= + +

Phn tch thut ton quy

Hm sinh
70
Xt:
| |
2
( ) 6 ( 1) 9 ( 2) 1 9
n
n
f x T n T n x x

=
= + +

| | | |
***
2 2
( ) 6 ( 1) 9 ( 2) 1 9
n n
n n
f x T n x T n x x

= =
= + +

| |
1
2 2
6 ( 1) 6 ( 1)
n n
n n
T n x x T n x

= =
=

| | | |
2
6 ( 1) 6 ( ) (0)
n
n
T n x x f x T

=
=

| | | |
2
6 ( 1) 6 ( ) 1
n
n
T n x x f x

=
=

Phn tch thut ton quy

Hm sinh
71
Xt:
| | | |
***
2 2
( ) 6 ( 1) 9 ( 2) 1 9
n n
n n
f x T n x T n x x

= =
= + +

| |
2 2
2 2
9 ( 2) 9 ( 2)
n n
n n
T n x x T n x

= =
=

| | | |
2
2
9 ( 2) 9 ( )
n
n
T n x x f x

=
=

Th vo ***:
( ) ( )
2
( ) 6 ( ) 1 9 ( ) 1 9 f x x f x x f x x = + +
Phn tch thut ton quy
Hm sinh
72
( ) ( )
2
( ) 6 ( ) 1 9 ( ) 1 9 f x x f x x f x x = + +
2 2 2 2
1 3 1 3 1 3
( )
9 6 1 (1 3 ) (1 3 ) (1 3 )
x x x
f x
x x x x x
+ +
= = = +
+
M: ( )
2
0
1
1 (3 )
(1 3 )
n
n
n x
x

=
= +

( )
2
0
3
3 1 (3 )
(1 3 )
n
n
x
x n x
x

=
= +

Phn tch thut ton quy
Hm sinh
73
2 2 2 2
1 3 1 3 1 3
( )
9 6 1 (1 3 ) (1 3 ) (1 3 )
x x x
f x
x x x x x
+ +
= = = +
+
M: ( )
2
0
1
1 (3 )
(1 3 )
n
n
n x
x

=
= +

( )
2
0
3
3 1 (3 )
(1 3 )
n
n
x
x n x
x

=
= +

Ta c:
( ) ( )
0 0
( ) 1 (3 ) 3 1 (3 )
n n
n n
f x n x x n x

= =
= + + +

Phn tch thut ton quy
Hm sinh
74
( ) ( )
0 0
( ) 1 (3 ) 3 1 (3 )
n n
n n
f x n x x n x

= =
= + + +

( ) ( )
0 0
( ) 1 3 3 1 3
n n n n
n n
f x n x x n x

= =
= + + +

( ) ( )
1 1
0 0
( ) 1 3 1 3
n n n n
n n
f x n x n x

+ +
= =
= + + +

( ) ( )
0 0
( ) 1 3 3
n n n n
n n
f x n x n x

= =
= + +

( )
0
( ) 2 1 3
n n
n
f x n x

=
= +

Vy:
( )
( ) 2 1 3 ( 3 )
n n
T n n O n = + =