Unformatted text preview: points) 6 Use a recursion tree to give an asymptotically tight solution to the recurrence T ( n ) = T ( na ) + T ( a ) + cn , where a ≤ 1 and c > 0 are constants. Express your answer in terms of T ( a ). (10 points) 7 Use the master method to give tight asymptotic bounds for the following recurrences (15 points) a. T ( n ) = 4 T ( n/ 2) + n b. T ( n ) = 4 T ( n/ 2) + n 2 c. T ( n ) = 4 T ( n/ 2) + n 3 8 Use the master method to show that the solution to the binarysearch recurrence T ( n ) = T ( n/ 2) + Θ(1) is T ( n ) = Θ(log n ). (15 points) 1...
View
Full
Document
This document was uploaded on 01/17/2012.
 Spring '09

Click to edit the document details