🏗️
Θ
ρ
ϵ
η
Π
α
τ
π
🚧 (under construction)
~
/
computer_science
/
runtime
Master
Let
a
,
b
∈
R
such that
a
≥
1
and
b
>
1
and let
T
,
f
:
N
0
→
R
≥
0
be defined such that
T
(
n
)
:
=
a
T
(
n
b
)
+
f
(
n
)
Then the following statements are true
If
f
∈
O
(
n
log
b
a
−
ϵ
)
for some
ϵ
∈
R
>
0
, then
T
(
n
)
∈
Θ
(
n
log
b
a
)
If
f
∈
Θ
(
n
log
b
a
)
then
T
(
n
)
∈
Θ
(
n
log
b
a
ln
(
n
)
)
If
f
∈
Θ
(
n
log
b
(
a
)
+
ϵ
)
for some constant
ϵ
∈
R
>
0
and the function
f
′
(
n
)
:
=
a
f
(
n
b
)
is eventually dominated up to a constant
c
∈
R
by
c
f
where
c
<
1
, then
T
(
n
)
∈
Θ
(
f
)
show proof