1 votes 1 votes T(n) = 2T(n/4) - n2 Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Feb 1, 2017 retagged Jun 4, 2017 by Arjun LavTheRawkstar 685 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments LavTheRawkstar commented Feb 2, 2017 reply Follow Share dear sir the answer written in book may also bewrong sometimes so dont worry about answer, just post the entire solution 0 votes 0 votes LavTheRawkstar commented Mar 12, 2017 reply Follow Share somebody please help in solving this ? 0 votes 0 votes LavTheRawkstar commented Mar 15, 2017 reply Follow Share somebody please tell please? 0 votes 0 votes Please log in or register to add a comment.