retagged by
3,388 views

2 Answers

Best answer
2 votes
2 votes

Answer
Correct me if I am wrong

selected by

Related questions

1.6k
views
1 answers
0 votes
aka 53 asked Nov 21, 2017
1,597 views
T(n) = 4T(n/2) + C ......where C ConstantT(n) = 16T(n/4) + 5CCant figure out how to generalize and compare with base condition T(n) = 1 from above step.
1.2k
views
2 answers
1 votes
Himanshu Goyal asked Oct 12, 2016
1,241 views
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method?c is a constant here.
5.1k
views
1 answers
5 votes
2.9k
views
0 answers
1 votes
PEKKA asked Dec 6, 2016
2,927 views
Solve the following Recurrence Equation using back substitution method T(n)= 2T(n/2)+log n​
Total PHP MySQL Other RAM
Time (ms) % Time (ms) % File count Time (ms) % Query count Time (ms) % Amount %
Setup 4.0 5% 2.5 3% 72 1.5 2% 2 0.0 0% 569k 48%
Control 12.7 18% 1.4 2% 5 11.5 17% 12 0.0 0% 233k 19%
View 1.6 2% 1.6 2% 12 0.0 0% 0 0.0 0% 87k 7%
Theme 42.4 62% 4.7 7% 15 37.7 55% 3 0.0 0% 281k 23%
Stats 6.9 10% 0.1 0% 0 6.8 10% 1 0.0 0% 0k 0%
Total 67.6 100% 10.3 15% 104 57.6 85% 18 0.0 0% 1172k 100%