251 views
0 votes
0 votes
Solution for recurrence relation T(n)=T(n/2 + 2)+n using recursion tree method?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
practicalmetal asked Sep 15, 2023
338 views
Consider the following function:function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); }Find the worst case time complexity of function...
0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Nov 1, 2018
413 views
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then$A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ ...
1 votes
1 votes
0 answers
3
NIHAR MUKHIYA asked Jul 15, 2017
428 views
T(n)=T(n/2+2)+nSolution using substitution method
0 votes
0 votes
1 answer
4
iarnav asked May 25, 2017
571 views
According to gate CS, where is recurrence relations are used?How to learn to use them in Algorithms in solving T(n) Questions.Kindly mention the video lecture source to s...