【ametachu】評論
Practice Problems For each of the following recurrences, give an expression for the runtime T (n) if the recurrence can be solved with the Master Theorem. Otherwise, indicate that the Master Theorem does not apply. 1. T (n) = 3T (n/2) + n 22. T (n) = 4T (n/2) + n 2 3. T (n) = T (n/2) + 2n 4. T (n) = 2nT (n/2) + n n5. T (n) = 16T (n/4) + n 6. T (n) = 2T (n/2) + n log n參考資料: https://www.csd.uwo.ca/~mmorenom/CS433-CS9624/Resources/master.pdf