1.Recursion Tree
2.Main theorem
例题:
case 1:
T
(
n
)
=
4
T
(
n
/
2
)
+
n
T(n)=4T(n/2)+n
T(n)=4T(n/2)+n
l
o
g
2
4
=
2
,
f
(
n
)
=
O
(
n
2
)
log_24=2,f(n)=\Omicron(n^2)
log24=2,f(n)=O(n2),
T
(
n
)
=
Θ
(
n
2
)
T(n)=\Theta(n^2)
T(n)=Θ(n2)
case 2:
T
(
n
)
=
4
T
(
n
/
2
)
+
n
2
T(n)=4T(n/2)+n^2
T(n)=4T(n/2)+n2
l
o
g
2
4
=
2
,
f
(
n
)
=
Θ
(
n
2
)
log_24=2,f(n)=\Theta(n^2)
log24=2,f(n)=Θ(n2),
T
(
n
)
=
Θ
(
n
2
l
g
n
)
T(n)=\Theta(n^2lgn)
T(n)=Θ(n2lgn)
case3:
T
(
n
)
=
4
T
(
n
/
2
)
+
n
3
T(n)=4T(n/2)+n^3
T(n)=4T(n/2)+n3
l
o
g
2
4
=
2
,
f
(
n
)
=
Ω
(
n
2
)
log_24=2,f(n)=\Omega(n^2)
log24=2,f(n)=Ω(n2),
T
(
n
)
=
Θ
(
n
3
)
T(n)=\Theta(n^3)
T(n)=Θ(n3)