5 votes 5 votes T(n) $\leq$ T($\frac{n}{5}$) + T($\frac{7n}{10}$) + 15n T(n) $\leq$ 5 when n $<$ 6 Algorithms time-complexity algorithms asymptotic-notation recursion + – Mk Utkarsh asked Jan 9, 2018 Mk Utkarsh 407 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply joshi_nitish commented Jan 9, 2018 reply Follow Share it will be O(n) 0 votes 0 votes Mk Utkarsh commented Jan 9, 2018 reply Follow Share procedure? 0 votes 0 votes Mk Utkarsh commented Jan 9, 2018 reply Follow Share ok i found it nevamind https://web.stanford.edu/class/archive/cs/cs161/cs161.1138/lectures/08/Small08.pdf 1 votes 1 votes Anuj Sharma commented Oct 22, 2019 reply Follow Share ans will be o(n).....a=1; b=10/7, k=1 ..by masters theoram 0 votes 0 votes Please log in or register to add a comment.