0 votes 0 votes Solve using Master's Theorem $T(n)=T(n/2)+$ 2n Algorithms master-theorem algorithms time-complexity + – Vishnathan asked Jul 16, 2018 Vishnathan 811 views answer comment Share Follow See 1 comment See all 1 1 comment reply Subham Nagar commented Jul 16, 2018 reply Follow Share is it O($2^{n}$) ? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes ............ abhishekmehta4u answered Jul 16, 2018 abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply Arjun commented Sep 1, 2018 reply Follow Share What about the regularity condition for Case 3 of Master's theorem? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 3rd Case of Masters Theorem, as mentioned in http://www.cse.unt.edu/~tarau/teaching/cf1/Master%20theorem.pdf $T(n) = \Theta (2^n)$ Aakash_ answered Jul 16, 2018 Aakash_ comment Share Follow See all 3 Comments See all 3 3 Comments reply James Bond commented Jul 16, 2018 reply Follow Share thanks for the reference, i was reading Narasimha Karumanchi but he mentioned different Master Theorem in his book 0 votes 0 votes Aakash_ commented Jul 16, 2018 reply Follow Share That's extended master's theorem http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/extended_master_theorem.pdf 1 votes 1 votes deepak verma 1 commented Sep 1, 2018 reply Follow Share So karumanchi book master theorem is correct ? Because he given in more simple way? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Order of 2 to the power n. Shivam Patidar answered Jul 18, 2018 Shivam Patidar comment Share Follow See all 0 reply Please log in or register to add a comment.