MarkAllenWeiss数据结构与算法分析课后习题答案2.docxVIP

Chapte:AlgorithmAnalysis 2.1 2/N , 37, √N , N , N log log N , N log N , N log (N2), N log2N , N 1.5, N 2, N2log N , N 3, 2N/ 2, 2N . N log N and N log (N2) grow at the samerate. 2.2 (a) True. (b) False. A counterexample is T 1(N ) = 2N , T2(N ) = N , and f (N ) = N . (c) False. A counterexample is T 1(N ) = N 2, T2(N ) = N , and f (N ) = N 2. (d) False. The same counterexample as in part (c) applies. 2.3 We claim that N log N is the slower growing function. To see this, suppose otherwise. Then, N ε/ √log N would grow slower than log N . Taking logs of both sides, we ?nd that, under this assumption, ε/ √log N log N grows slower than log log N . But the ?rst expres- sion simpli?es to ε√log N . If L = log N , then we are claiming that ε√L grows slower than log L , or equivalently, that 2εL grows slower than log2 L . But we know that log 2 L = ο(L ), so the original assumption is false, proving the claim. 2.4 Clearly, log k1 N = ο(log k2N ) if The claim is clearly true for L’ Hospital ru’les, k 1 k 2 , so we need to worry only about positive integers. k = 0 and k = 1. Suppose it is true for k i . Then, by lim ______ = lim i _______logi lim ______ = lim i _______ N →∞ N N →∞ N The second limit is zero by the inductive hypothesis, proving the claim. 2.5 Let f (N ) = 1 when N is even, and N when N is odd. Likewise, let g (N ) = 1 when N is odd, and N when N is even. Then the ratio f (N ) / g (N ) oscillates between 0 and ∞. 2.6 For all these programs, the following analysis will agreewith a simulation: (I) The running time is O (N ). (II) The running time is O (N2). (III) The running time is O (N3). (IV) The running time is O (N2). (V) j can be as large as i 2 , which could be as large as N 2. k can be as large as j , which is N 2. The running time is thus proportional to N .N2. N 2, which is O ( N5). (VI) The if statement is execute