1 flag 1,265 views
1 votes
1 votes
T(n) = T(n/4) + T(3n/4) + n

How to solve these type of problems?

Can I solve this using master theorm by considering X = T(3N/4) +N THEN

T(N) = T(N/4) +X

CAN WE SOLVE LIKE THIS?

PLEASE HELP
  • 🚩 Duplicate | 👮 Hira Thakur | 💬 “https://gateoverflow.in/191487/t-n-t-n-4-t-3n-4-n”
1 flag

1 Answer

Related questions

1 votes
1 votes
0 answers
1
srestha asked May 19, 2019
594 views
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
1 votes
1 votes
2 answers
2
srestha asked May 10, 2019
844 views
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
1 votes
1 votes
1 answer
3
VikramRB asked Jan 20, 2019
1,005 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$
1 votes
1 votes
1 answer
4
sripo asked Nov 14, 2018
1,570 views
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1