0 votes 0 votes T(n)= T(4n/5)+O(n)... we can't apply master's theorem to solve it??? And if not then how are we going solve this.. saif asked Dec 1, 2018 saif 302 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply goxul commented Dec 1, 2018 reply Follow Share You can do with induction - the answer should be $O(n)$ I am guessing. 0 votes 0 votes aambazinga commented Dec 1, 2018 reply Follow Share we can also do it using recursive tree method... answer will be O(n) 0 votes 0 votes Prateek Raghuvanshi commented Dec 1, 2018 reply Follow Share We can apply tree method- 1 votes 1 votes Please log in or register to add a comment.