《算法导论》第3版 第3章课后题答案（英文版）

Solution to Exercise 3.1-2

To show that (n+a)^b = Θ(n^b), we want to find constants c₁, c₂, n₀ ＞ 0 such that

0 ≤ c₁n^b ≤ (n+a)^b ≤ c₂n^b for all n ≥ n₀

Note that

n + a ≤ n + |a| ≤ 2n when |a|≤n,

and

n + a ≥ n - |a| ≥ 1/2n when |a|≤1/2n,

Thus, when n ≥ 2|a|

0 ≤ 1/2n ≤ n + a ≤ 2n,

Since b > 0, the inequality still holds when all parts are raised to the power b:

0 ≤ (1/2n)^b ≤ (n+a)^b ≤ (2n)^b,

0 ≤ (1/2)^bn^b ≤ (n+a)^b ≤ 2^bn^b,

Thus, c1 = (1/2)^b, c2 = 2^b, and n₀ = 2|a| satisfy the definition.

Solution to Exercise 3.1-3

Let the running time be T(n). T(n) ≥ Ο(n²) means that T(n) ≥ f(n) for some function f(n) in the set Ο(n²). This statement holds for any running time T(n), since the function g(n) = 0 for all n is in Ο(n²), and running times are always nonnegative. Thus, the statement tells us nothing about the running time.

Solution to Exercise 3.1-4

2ⁿ⁺¹ = Ο(2ⁿ), but 2²ⁿ ≠ Ο(2ⁿ)

To show that 2ⁿ⁺¹ = Ο(2ⁿ), we must find constant c, n₀ ＞ 0 such that

0  ≤  2ⁿ⁺¹  ≤ c · 2ⁿ  for all n ＞ n₀ ,

Since 2ⁿ⁺¹ = 2 · 2ⁿ for all n, we can satisfy the definition with c = 2 and n₀ = 1

To show that 2²ⁿ ≠ Ο(2ⁿ), assume there exist constants c, n₀ ＞ 0 such that

0 ≤ 2²ⁿ ≤ c · 2ⁿ for all n > n₀ ,

The 2²ⁿ = 2ⁿ · 2ⁿ  ≤ c · 2ⁿ for all n ≥ n₀ ,

Then 2²ⁿ = 2ⁿ · 2ⁿ ≤ c · 2ⁿ => 2ⁿ ≤ c. But no constant is greater than 2ⁿ, and so the assumption leads to a contradiction.

*Solution to Exercise 3.2-4

⌈lgn⌉! is not polynomially bounded, but ⌈lglgn!⌉ is.

Proving that a function f(n) is polynomially bounded is equivalent to proving that lg(f(n)) = Ο(lgn) for the following reasons.

· if f is polynomially bounded, then there exits constant c, k, n₀ such that

for all n ≥ n₀, f(n) ≤ cn^k. Hence, lg(f(n)) ≤ kclgn, which, since c and k are constants, means that lg(f(n)) = Ο(lgn).

· Similarly, if lg(f(n)) = Ο(lgn), then f is polynomially bounded.

In the following proofs, we will make use of the following two facts:

1. lg(n!) = Θ(nlgn) (by equation (3.19))

2. ⌈lgn⌉ = Θ(lgn), because

· ⌈lgn⌉  ≥ lgn

· ⌈lgn⌉  ≤ lgn + 1 ≤ 2lgn for all n ≥ 2

lg(⌈lgn⌉!) = Θ(⌈lgn⌉lg⌈lgn⌉) = Θ(lgn lg lgn) = ω(lgn).

Therefore, lg(⌈lgn⌉!) ≠ Ο(lgn), and so ⌈lgn⌉! is not polynomially bounded.

lg(⌈lglgn⌉!) = Θ(⌈lglgn⌉lg⌈lglgn⌉) = Θ(lglgn lg lglgn) = ο((lglgn)²) = ο(lg²(lgn))   = ο(lgn) .

The last step above follows from the property that any polylogarithmic function grows more slowly than any positive polynomial function, i.e., that for constants a, b ＞ 0, we have lg^bn = ο(n^a). Substitute lgn for n, 2 for b, and 1 for a, giving lg²(lgn) = ο(lgn).

Therefore, lg(⌈lglgn⌉!) = Ο(lgn), and so ⌈lglgn⌉! is polynomially bounded.