1 votes 1 votes T(n)=T $(\frac{n}{2})$ + T $(\frac{n}{4})$ + n2 Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Mar 27, 2017 retagged Jun 4, 2017 by Arjun LavTheRawkstar 526 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Order of n² Rameez Raza answered Mar 27, 2017 Rameez Raza comment Share Follow See 1 comment See all 1 1 comment reply Rameez Raza commented Mar 27, 2017 reply Follow Share https://gateoverflow.in/65709/%23recurrence-relation 1 votes 1 votes Please log in or register to add a comment.