Can someone please check if the following big O estimate is correct? Thanks! n^2n + n^(n^2) Big O Estimate: O(n^n) since n^n must be faster than n^(n^2)?
Follow Math Help Forum on Facebook and Google+
Originally Posted by hotmail590 Can someone please check if the following big O estimate is correct? Thanks! n^2n + n^(n^2) Big O Estimate: O(n^n) since n^n must be faster than n^(n^2)? This is , since is negligable in comparison to , for large enough RonL
Originally Posted by hotmail590 Can someone please check if the following big O estimate is correct? Thanks! n^2n + n^(n^2) Big O Estimate: O(n^n) since n^n must be faster than n^(n^2)? To clarify, in case there has been a misunderstanding: and: RonL
View Tag Cloud