0 votes 0 votes closed with the note: Got Answer When T(n) = a T(n/b) + f(n) If on solving we get g(n) as upper bound solution for the recurrence. Is f(n) = O( g(n) ) always correct? Algorithms recurrence-relation time-complexity algorithms asymptotic-notation + – smsubham asked Apr 3, 2018 • closed Apr 3, 2018 by smsubham smsubham 295 views comment Share Follow See all 2 Comments See all 2 2 Comments reply Mk Utkarsh commented Apr 3, 2018 reply Follow Share $T(n) = O(g(n))$ $\rightarrow f(n) = O(g(n)) $ 1 votes 1 votes srestha commented Apr 3, 2018 reply Follow Share yes Indirectly that is what master theorem says right? 0 votes 0 votes Please log in or register to add a comment.
