1 votes 1 votes closed as a duplicate of: T(n) = T(n/4) + T(3n/4) +n T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1 T(n) = ?? Algorithms recurrence-relation algorithms + – Ravi_1511 asked Jan 21, 2017 • closed Jan 10 by Hira Thakur Ravi_1511 350 views comment Share Follow See 1 comment See all 1 1 comment reply focus _GATE commented Jan 21, 2017 reply Follow Share use recursive tree method than answer will be O(nlog4/3n) 3 votes 3 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes Using recursion Tree method we get Time Complexity is O(nlog4/3n). Arnab Bhadra answered Jun 13, 2017 • selected Jul 1, 2017 by focus _GATE Arnab Bhadra comment Share Follow See all 0 reply Please log in or register to add a comment.
