2 votes 2 votes Big-$O$ estimates for the factorial function and the logarithm of the factorial function i.e. $n!$ and $\log n!$ is given by $O(n!)$ and $O(n \log n)$ $O(n^{n})$ and $O(n \log n)$ $O(n!)$ and $O(\log n!)$ $O(n^{n})$ and $O(\log n!)$ Algorithms ugcnetcse-june2014-paper2 algorithms time-complexity asymptotic-notation + – makhdoom ghaya asked Jun 27, 2016 • retagged Jul 8, 2016 by Arjun makhdoom ghaya 5.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes n!=1*2*3*4............*n-1*n <= n*n*n*n..........*n=(n)n =O((n)n) log(n!)<=log(n)n =n log n=O(n log n) ans is B Prasanjeet Ghosh answered May 8, 2018 • selected Jun 2, 2020 by soujanyareddy13 Prasanjeet Ghosh comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes they have asked estimation, so I think answer would be B, in complexity theory, n! = nn O( n! ) = O( nn ) and O( log( n! ) ) = O ( n log(n) ) rameshbabu answered Jun 28, 2016 rameshbabu comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes O(n!) and O(logn!) Digvijay Pandey answered Jun 27, 2016 Digvijay Pandey comment Share Follow See all 4 Comments See all 4 4 Comments reply ManojK commented Jun 27, 2016 reply Follow Share sir why not option B ? 1 votes 1 votes Digvijay Pandey commented Jun 27, 2016 reply Follow Share Actually all are true but out of 4 if i have to select one then i will select option B . 2 votes 2 votes Arjun commented Jun 30, 2016 reply Follow Share I would choose E :) 3 votes 3 votes ManojK commented Jun 30, 2016 reply Follow Share E should be mark to all. 1 votes 1 votes Please log in or register to add a comment.