3 votes 3 votes I have doubt regarding Master theorem.In which situation we should use Normal Master theorem/extended Master theorem? Algorithms algorithms master-theorem time-complexity + – Sona Barman asked Jan 8, 2018 Sona Barman 2.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Raushank2 commented Jan 8, 2018 reply Follow Share If recurrence relation is of the form T(n)=aT(n/b)+f(n) Then use master theorem and use Extended Master theorem when recurrence relation is of the form T(n)=2T(n/2)+ nlogn here a=2, b=2 so, nlog2 2 =n and f(n)= nlogn nlog2 2 =n is smaller by logn. So we can use Extended Master theorem T(n)= Θ(n (log n)2) 2 votes 2 votes Please log in or register to add a comment.