retagged by
5,256 views
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 

  1. $O(n!)$ and $O(n \log n)$
  2. $O(n^{n})$ and $O(n \log n)$ 
  3. $O(n!)$ and $O(\log n!)$ 
  4. $O(n^{n})$ and $O(\log n!)$  
retagged by

3 Answers

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) )

0 votes
0 votes
O(n!) and O(logn!)
Answer:

Related questions

0 votes
0 votes
2 answers
3
makhdoom ghaya asked Jul 1, 2016
3,371 views
Match the following $:$$\begin{array} {cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \tex...
2 votes
2 votes
3 answers
4
makhdoom ghaya asked Jul 1, 2016
19,964 views
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of t...