0 votes 0 votes Obtain asymptotically tight bounds on $lg\ (n!)$ without using Stirling’s approximation. Instead, evaluate the summation $\sum_{k=1}^{n} lg\ k$. Algorithms cormen algorithms asymptotic-notation descriptive + – akash.dinkar12 asked Jun 28, 2019 akash.dinkar12 468 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes this might help Asim Siddiqui 4 answered Jul 15, 2019 Asim Siddiqui 4 comment Share Follow See all 0 reply Please log in or register to add a comment.