This preview shows page 1. Sign up to view the full content.
Unformatted text preview: points) 6 Use a recursion tree to give an asymptotically tight solution to the recurrence T ( n ) = T ( n-a ) + 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 binary-search recurrence T ( n ) = T ( n/ 2) + (1) is T ( n ) = (log n ). (15 points) 1...
View Full Document
- Spring '09