2 votes 2 votes Solve the Recurrence using Iteration Method T(n)=3$(\frac{n}{4})$ + n Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked May 7, 2017 • retagged Jun 4, 2017 by Arjun LavTheRawkstar 1.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply Sanjay Sharma commented Jul 5, 2017 reply Follow Share it is 3(n/4) or 3T(n/4) ? 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes 2 options to solve this question Aashish S answered May 7, 2017 Aashish S comment Share Follow See 1 comment See all 1 1 comment reply Samujjal Das commented May 7, 2017 reply Follow Share Try writing your answers using fx . You can see that at the top of the text editor where you write your answers. :-) 1 votes 1 votes Please log in or register to add a comment.
3 votes 3 votes Method 2 Aashish S answered May 7, 2017 Aashish S comment Share Follow See all 0 reply Please log in or register to add a comment.
