算法导论(第三版)参考答案:练习4.6-1,练习4.6-2,练习4.6-3
Exercise 4.6-1
⋆ Give a simple and exact expression for nj in equation (4.27) for the case in which b is a positive integer instead of an arbitrary real number.
Exercise 4.6-2
⋆ Show that if f(n)=Θ(nlogbalgkn) , where k≥0 , then the master recurrence has solution T(n)=Θ(nlogbalgk+1n) . For simplicity, confine your analysis to exact powers of b .
将 f(n/bj)=Θ((n/bj)logbalgk(n/bj)) 代入 g