1 votes 1 votes what is time complexity for T(n) = √n.T(√n) + √n ? Algorithms time-complexity asymptotic-notation algorithms + – Saswat Senapati asked Jun 11, 2017 Saswat Senapati 515 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Short Answer - $\Theta (n)$ Long Answer - By using substitution method, the recurrence equation can be solved as follows, (If the image below is not viewable, then open this link - https://goo.gl/6lBE0i) Aman Vats answered Jun 11, 2017 • selected Jun 11, 2017 by Saswat Senapati Aman Vats comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Answer Arnab Bhadra answered Jun 12, 2017 Arnab Bhadra comment Share Follow See all 0 reply Please log in or register to add a comment.
