0 0 votes How to solve T (n)=T (sqrt n)+ n Algorithms master-theorem recurrence-relation made-easy-booklet + – Priyanka Agarwal 1.2k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes The answer is theta(n) ? Phlegmatic answered Jun 22, 2018 Phlegmatic comment Share Follow See 1 comment 1 1 comment reply Priyanka Agarwal commented Jun 22, 2018 reply Follow flag Ans is theta(log log n) 0 0 replyShare Please log in or register to add a comment.
0 0 votes How answer can be theta(log(log n)) Phlegmatic answered Jun 22, 2018 Phlegmatic comment Share Follow See 1 comment 1 1 comment reply Priyanka Agarwal commented Jun 22, 2018 reply Follow flag In workbook ans is mentioned as theta(log (logn)) Actually i am also getting ans as theta (n) 0 0 replyShare Please log in or register to add a comment.
0 0 votes Workbook answer is notoriously wrong. May be this helps https://www.quora.com/What-is-the-complexity-of-recurrence-relation-T-n-2T-root-n-+n/answer/Daniel-R-Page https://www.quora.com/What-is-the-complexity-of-t-n-t-%E2%88%9An-+n/answer/Daniel-R-Page https://www.reddit.com/r/askmath/comments/4hzrzt/why_is_tn_tsqrtn_n_in_on/ nephron answered Oct 30, 2018 nephron comment Share Follow 0 reply Please log in or register to add a comment.
