algorithm - Giving a simple function so that sum S(n) is O(f(n))? -


Stuck on for some time

Consider the amount S (n) = one? ?? Logs (i). Give a simple task f (n) so that zeros are s (n) o (f (n)). Explain

(Sigma starts with = 1 and ends at n)

How can I do this? Please explain step by step.

Just because log is monotonic: sum [i = 1..n] log (i)

then it o (n * log (n))

and to confirm that We can not improve this compulsion:

amount [i = 1..n] log (i) & gt; = Yoga [i = n / 2..n] log (i) & gt; = Sum [i = n / 2..n] log (n / 2) = (n / 2) * log (n / 2)

then it is omega * Log (n))

Comments

Popular posts from this blog

php - PDO bindParam() fatal error -

logging - How can I log both the Request.InputStream and Response.OutputStream traffic in my ASP.NET MVC3 Application for specific Actions? -

java - Why my included JSP file won't get processed correctly? -