2 votes 2 votes T(n)= 3$T(\frac{n}{4})$ + θ(n2) Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Jan 31, 2017 retagged Jun 4, 2017 by Arjun LavTheRawkstar 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes something like this... Smriti012 answered Feb 1, 2017 Smriti012 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Why u need to solve it by tree method when u can do by master theorem directly! Smriti012 answered Feb 1, 2017 Smriti012 comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Smriti012 commented Feb 4, 2017 reply Follow Share (log a base b) i.e. log b a= (log a)/(log b) 1 votes 1 votes LavTheRawkstar commented Feb 4, 2017 reply Follow Share okay mam thank you so much i got it. 0 votes 0 votes Smriti012 commented Feb 4, 2017 reply Follow Share thanks to you too!! any more doubts then plz do tell... but not full quesn! 1 votes 1 votes Please log in or register to add a comment.