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 Algorithms recurrence-relation time-complexity algorithms + – 🚩 Duplicate | 👮 Hira Thakur | 💬 “https://gateoverflow.in/191487/t-n-t-n-4-t-3n-4-n” Mayankprakash asked Jan 4, 2019 Mayankprakash 1.3k views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments arvin commented Jan 6, 2019 reply Follow Share you can use that also but it will give Ω(nlog3n).. because the length of chain will be small as compared to T(2n/3) 0 votes 0 votes Mayankprakash commented Jan 7, 2019 reply Follow Share @arvin @Nandkishor3939 how you guys are calculating T(1)? please tell in detail ..I'm not able to understand 0 votes 0 votes Nandkishor3939 commented Jan 7, 2019 reply Follow Share If you solve the rec reln by traditional method(by substitution and not by tree method) you will see that T(n/(3/2)) will be like T(n/(3/2)^k) for k th transaction .... so substitute T(1)=T(n/(3/2)^k) because we need to kind value of k such that we will reach the last stage of recurrence relation i.e. T(1) thus we will get an idea of how deep the tree(it is quite intuitive !) will be (that's what the discussion was all about) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Solve it by making recurrence tree vikash_thakur answered Jun 15, 2019 vikash_thakur comment Share Follow See all 0 reply Please log in or register to add a comment.