# Cormen Edition 3 Exercise 2.2 Question 4 (Page No. 29)

80 views
How can we modify almost any algorithm to have a good best-case running time?
0
By using randomization technique.

Is the function $\lceil$ $lg$ $n$ $\rceil$!$polynomially bounded ? Is the function$\lceillglgn\rceil$!$ polynomially bounded ?
Is $2^{n+1} = O(2^n)$? $2^{2n} = O(2^n)$?$0 votes 1 answer 3 85 views Obtain asymptotically tight bounds on$lg\ (n!)$without using Stirling’s approximation. Instead, evaluate the summation$\sum_{k=1}^{n} lg\ k$. 0 votes 1 answer 4 75 views Prove that$n!=\omega(2^n)$and$n!=o(n^n)\$.