For the computation of the run time/big O notation of sum(log factorial), i.e., $\sum(\log(n!))$, is the Big(O) run time for this $O(n^2)$?
Why is that?
Sum(log(n!)) Big(O) notation and graphical properties
0
$\begingroup$
discrete-mathematics
asymptotics
-
0For more context: http://math.stackexchange.com/questions/2152256/big-o-notation-on-the-log-factorial – 2017-02-20
-
0@SimplyBeautifulArt, this question is a bit modified and I looked at the other one as well, but my question got ignored – 2017-02-20
-
0This needs a lot of clarification. Do you want some big $O$ value for $\sum_{k=1}^n \log(k!)$? $\sum\log(n!)$ is meaningless. – 2017-02-20
-
0I want the sum from k = 1 to n Log(k!).....i.e., # Return the sum of log_factorial(i) for i in 1..n – 2017-02-20
-
0@NinaMcGyver I am just saying it's additional context. – 2017-02-20
-
0@ThomasAndrews. Yes--I updated it above. Please advise – 2017-02-20