1 1 vote Give Big-O estimate: ${f(x)=n^{2n} + n^{n^2}}$ The answer is given $O(n^{2n})$ But, isn't $n^{n^2} > n^{2n}$ for n>2? If yes, then how is it $O(n^{2n})$? Set Theory & Algebra time-complexity asymptotic-notations + – codinion 1.3k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Arjun commented Apr 7, 2017 reply Follow flag Where is the answer given? 1 1 replyShare Angkit commented Apr 8, 2017 reply Follow flag i think the answer given is wrong. 0 0 replyShare codinion commented Apr 9, 2017 reply Follow flag The answer is given in Discrete Mathematics by Rosen in exercise 3.3 on big o notation. 0 0 replyShare Please log in or register to add a comment.
Best answer 1 1 vote Yes it should be O (n^n^2) Purvi Agrawal answered Apr 8, 2017 • selected Apr 9, 2017 by codinion Purvi Agrawal comment Share Follow 0 reply Please log in or register to add a comment.
