a04-chap4-Recurrence 算法导论 教学课件.pptVIP

* * ?: Let T(n) = d.f(n), then T(n) = a.T(n/b)+f(n) ? d.f(n) = a.d.f(n/b) + f(n) If a.f(n/b) f(n) ,then d.f(n) = a.d.f(n/b) + f(n) d.f(n) + f(n) = (d+1).f(n) ? d d+1 * * * * * * * Polynomially Case 1, f(n) must be polynomially smaller than . Case 3, f(n) must be polynomially larger than . Gap There is a gap between cases 1 and 2 when f(n) is smaller than but not polynomially smaller. Similarly, there is a gap between cases 2 and 3 when f(n) is larger than but not polynomially larger. 4.4.1 The master theorem: special cases * T(n)=9T(n/3)+n T(n)=T(2n/3)+1 4.4.2 Using the master method: some examples * T(n)=3T(n/4)+nlgn 4.4.2 Using the master method: some examples * T(n)=2T(n/2)+nlgn 4.4.2 Using the master method: some examples * Exercises and problems Exercises 4.1-1, 4.1-2, 4.1-3, 4.1-5, 4.1-6 4.2-1, 4.2-3 4.3-1, 4.3-2, 4.3-3 Problems 4-1 a, d, g, h ; 4-4 d, f, i, j ; * 思考题: 4-6 ; 4-7 * * * * * * * * * * * * * * * * * * * * * * * * * * * * BeihangSoft.cn * * Difficulty of Algorithms Research Model 建模 Specify 描述 Correctness 正确性 Verify 验证 Proof 证明 Complex 复杂度 （Efficiency 有效性） Actual computing 实际可计算性 Recurrence is a basic method to analyze algorithm 4 Recurrences Design 设计 Correctness Analysis 正确性分析 Computing Analysis 可计算性分析 * Algorithms analysis sum 4 Recurrences INSERTION-SORT(A) cost times 1 for( j = 2; j =length[A]; j++) c1 n 2 { key = A[j] c2 n-1 3 // Insert A[j] into the sorted sequence A[1 .. j-1] 0 n-1 4 i = j-1 c4 n-1 5 while( i 0 A[i] key) c5 6 { A[i+1] = A[i] c6 7 i = i-1 c7 8 } 9 A[i+1] = key c8 n-1 10 } * Algorithms analysis recursion 4 Recurrences cost MERGE-SORT(A, p, r) T(n) 1 if p r 2 Then q