1 votes 1 votes T(n) =3T($n^{_{3}^{1}}$) + log 3n Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked May 7, 2017 retagged Jun 4, 2017 by Arjun LavTheRawkstar 671 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply LavTheRawkstar commented May 7, 2017 reply Follow Share somebody please tell this please please 0 votes 0 votes LavTheRawkstar commented May 7, 2017 reply Follow Share i beg everyone please tell this i have been solving this since 1 hour please tell 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Pls correct me if i am wrong Aashish S answered May 7, 2017 Aashish S comment Share Follow See all 2 Comments See all 2 2 Comments reply ishan007 commented Oct 30, 2017 reply Follow Share I think ur solution is correct but only if log is of base 3 and logn is in question ,but I think it is log(power(3,n)). 0 votes 0 votes Aashish S commented Oct 30, 2017 reply Follow Share pls write the complete solution of the same - log(power(3,n)). 0 votes 0 votes Please log in or register to add a comment.