retagged by
452 views
0 votes
0 votes
Write the Big-O notation for the following functions. Mention if they are exponential,
polynomial, logarithmic or neither of those. Proof is not required, but write one or
two sentences about how you arrived at the answer.

(a) n log n + .01n$^{3/2}$  + 10n
(b) $\frac{log n!}{n}$
(c) 1.01$^{n}$ + n3
(d) .99$^{n}$ + n
(e) log(n + n – 1 + ……..+ 1)
(f) n.$^{.01}$ + log n2
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
3
Amoljadhav asked Mar 1
96 views
how many spanning trees are possible for complete graph of 4 vertices
0 votes
0 votes
1 answer
4
vijju532 asked Jul 7, 2018
327 views
15.4-1 is it right ???ans is 6 ??is there any other method to determine the lcs coz it requires time to compute till the whole traversal of matrix