Example of recursion tree Solve(m)=70n/4)+7(m/2)+n (n/4)2 16 (n/16)2(m/8)2(m/82(m/4) ⊙ Day 3 Introduction to Algorithms L2.15Day 3 Introduction to Algorithms L2.15 Example of recursion tree Solve T(n) = T(n/4) + T(n/2) + n2: (n/16)2 (n/8)2 (n/8)2 (n/4)2 (n/4)2 (n/2)2 Θ(1) … 2 16 5 n 2 n n 2