1 votes 1 votes Consider the recurrence T(n)=2T(n/2)+nlogn Find complexity Algorithms recurrence-relation time-complexity + – sh!va asked Jul 26, 2016 retagged Jun 15, 2022 by makhdoom ghaya sh!va 472 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply LeenSharma commented Jul 26, 2016 reply Follow Share http://math.stackexchange.com/questions/159720/how-to-solve-this-recurrence-tn-2tn-2-n-log-n 0 votes 0 votes Kapil commented Jul 26, 2016 reply Follow Share Use extended master theorem.. http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/extended_master_theorem.pdf 0 votes 0 votes Please log in or register to add a comment.