0 votes 0 votes Solve by using master's theorem Algorithms time-complexity master-theorem algorithms asymptotic-notation recurrence-relation + – bts asked Jul 17, 2018 bts 559 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Anand. commented Jul 17, 2018 reply Follow Share is it $\theta(n \log n)?$ 0 votes 0 votes bts commented Jul 17, 2018 reply Follow Share Yes, but I wanna know how 0 votes 0 votes bts commented Jul 17, 2018 reply Follow Share Yes, but I want to know how. 0 votes 0 votes air1ankit commented Jul 18, 2018 reply Follow Share @bts check "extended master method" on youtube. understand how to use the "extended master method" , you need to by heart something and you can easily solve all question related to the master method 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes T(n) = O(nlogn) abhishekmehta4u answered Jul 17, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
