0 0 votes how to solve these two using matser thorem. 1. t(n)=2t(√n)+n 2. t(n)=4t(√n)+(logn)^2 Algorithms testbook-test-series algorithms time-complexity master-theorem + – rajan 742 views answer comment Share Follow Print See 1 comment 1 1 comment reply Manish Tripathi commented Dec 9, 2016 reply Follow flag Master's method extension 0 0 replyShare Please log in or register to add a comment.
0 0 votes Substitute n as some function of 2^k. So, k = log n. Now equation will in form of 2^k. Now reduce the equation into S(k) = 2S(k/2) + k and solve using master's theorem. And replace 'k' by log n. Manish Tripathi answered Dec 9, 2016 Manish Tripathi comment Share Follow See 1 comment 1 1 comment reply rajan commented Dec 9, 2016 reply Follow flag plz elobrate ur soln speciallly for 2nd 0 0 replyShare Please log in or register to add a comment.
