Computers and Technology, 15.10.2020 09:01 ZachLaVine2016
Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 4T(n/2 + 2) + n. Use the substitution method to verify your answer.
Answers: 3
at depth. 
leaves. 
![= \sum_ {i = 0} \lg n - 1 2^i n + \sum_{i = 0} \lg n - 12 \times 4^i + \Theta (n^2)\\\\= [ \frac{ 2\lg n - 1}{ 2 - 1} ]n + 2 \times [ \frac{ 4\lg n - 1}{ 4 - 1} ]n + \Theta (n^2)\\\\= ( 2\lg n - 1) n] + (\frac{2}{3})( 4\lg n - 1)+ \Theta (n^2)\\\\= (n-1)n - \frac{2}{3} (n^2 -1) +\Theta (n^2)\\\\= \Theta (n2)\\](/tpl/images/0807/0270/fc257.png)
![\to T(n) \leq c (n^2 - dn) \\\\T(n) = T(n) = 4T((\frac{n}{2}) + 2) + n \\\\ \leq 4c [ ((\frac{n}{2}) + 2)2 - d((\frac{n}{2}) + 2) ]+ n \\\\ \leq 4c [ (\frac{n^2}{4} + 2n + 4) - \frac{dn}{2} - 2d)]+ n \\\\\leq cn2 + 8cn + 16c - 2cdn - 8cd + n\\\\\leq cn2 -cdn + 8cn + 16c - cdn - 8cd + n\\\\\leq c(n2 -dn) - (cd- 8c - 1)n - (d - 2). 8c\\\\\leq c(n2 -dn),\\\\](/tpl/images/0807/0270/7939e.png)
.Another question on Computers and Technology
Computers and Technology, 24.06.2019 04:30
What is the process in which the software development team compiles information to determine the final product
Answers: 1
Computers and Technology, 24.06.2019 13:30
In the rgb model, which color is formed by combining the constituent colors? a) black b) brown c) yellow d) white e) blue
Answers: 1
Computers and Technology, 24.06.2019 22:30
To add additional commands to the quick access toolbar, a user can navigate to the view. backstage status bar design file
Answers: 2
Computers and Technology, 25.06.2019 03:00
Between 1932 and 1938, chester carlson developed a process that enabled a "picture" of a document to be taken and then have it reproduced on another
Answers: 1
You know the right answer?
Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 4T(n/2 + 2)...
Questions
Chemistry, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
English, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Geography, 01.02.2021 01:50
Social Studies, 01.02.2021 01:50
Computers and Technology, 01.02.2021 01:50
Mathematics, 01.02.2021 01:50
Law, 01.02.2021 01:50
