1 votes 1 votes Find time complexity? a) T(n) = T(n/2) + pow(2,n) b) T(n) = T(pow(n,1/2)) + n c) T(n) = 16T(n/4) + n! d) T(n) = pow(2,1/2)*T(n/2) + log n can we apply master theorem on the above problem? Daniyal89 asked Sep 16, 2018 • edited Sep 16, 2018 by Daniyal89 Daniyal89 3.2k views answer comment Share Follow See all 19 Comments See all 19 19 Comments reply Show 16 previous comments Priyadrasta Raut commented Nov 2, 2019 reply Follow Share What is the answer for option b using master's theorem??Is it O(n)? 0 votes 0 votes sakharam commented Nov 5, 2019 reply Follow Share @Priyadrasta Raut Yes its $\Theta (n)$ 0 votes 0 votes amcodes18 commented Jan 30, 2020 reply Follow Share i still cant solve 2nd one using masters theorem , can anyone help? 0 votes 0 votes Please log in or register to add a comment.