算法分析技巧与分析习题答案.docVIP

Page 54 1.16 The minimum number of element comparisons performed by the algorithm is n－1. This minimum is achieved when the input A[1..n] is already sorted in nondecreasing order. The maximum number of element comparisons performed by the algorithm is (n－1)+( n－2)+…+ 2+1=n(n－1)/2. This maximum is achieved when the input A[1..n] is already sorted in decreasing order. The minimum number of element assignments performed by the algorithm is 0. This minimum is achieved when the input A[1..n] is already sorted in nondecreasing order. The maximum number of element assignments performed by the algorithm is 3[(n－1)+( n－2)+…+ 2+1]=3n(n－1)/2. This maximum is achieved when the input A[1..n] is already sorted in decreasing order. （e） The running time of Algorithm BUBBLESORT is ((n2) in terms of the (-notation, and ((n) in terms of the (-notation. （f）The running time cannot be expressed in terms of (-notation, because the running time ranges from the linear to quadratic. Page 99 2.16 （a）On the one hand，∑j=1n jlog j≤∑j=1n nlog n≤n 2 log n. On the other hand，∑j=1n jlog j≥∑j= (n/2( n (n/2(log (n/2( ≥(n/2( (n/2(log (n/2( ≥(n-1)n/4·log(n/2). Hence，∑j=1n jlog j=( (n 2logn). （b）Let f(x)=x log x (x≥1). Since f(x) is an increasing function，we have ∑j=1n jlog j≤∫1n+1 x log xdx≤(2(n+1)2 ln(n+1)-(n+1)2+1) / (4ln2). Also, ∑j=1n jlog j=∑j=2n jlog j≥∫1n x log xdx≥(2n2 lnn-n2+1) / (4ln2). Thus，∑j=1n jlog j=( (n 2lnn)= ( (n 2logn). 2.18 The characteristic equation is x=3. Thus, f(n)=c·3n （n≥0），where c is determined by the initial value of the sequence : f(0). Solving the equation f(0)=5=c, we obtain c=5. It follows that f(n)=5·3n （n≥0）. The characteristic equation is x=2. Thus，f(n)=c·2n （n≥0），where c is determined by the initial value of the sequence : f(0). Solving the equation f(0)=2=c, we obtain c=2. It follows that f(n)=2n+1 （n≥0）. 2.19 (a) The characteristic equation is x2-5x +6=0, and hence x1=2 and x2=3.Thus, the solution to the recurrence i