@Shaik Masthan @arvin
please help me on this
Then how do we tackle these type of problems?
can you please provide easy way to solve these
brother use recursive tree method when there is more than one function...
and go with basics it will help you to reduce it to simple methods.
refer this : https://www.cs.cornell.edu/courses/cs3110/2012sp/lectures/lec20-master/lec20.html
@Hemanth_13 it will be nlogn(approx) why n? check once
Hey @arvin , in the second example of the below site (T(n) = T(n/3) + T(2n/3) + n.)
how we came to know that size of the tree is log3/2 n ??
@Nandkishor3939 till T(1)=T(n/(3/2)^k) means n/(3/2)^k= 1 simplify this and you will get k = log(3/2)n and it will be the longest path and n/(3)^k will be the shortest path k= log3n...
@arvin why not T(1)=T(n/(3)^k)
how you guys are calculating T(1)?
please tell in detail ..I'm not able to understand