1 votes 1 votes Why [logn]! is not polynomial bounded where [loglogn]! is polynomial bounded? Note [ ] is greatest integer function Algorithms time-complexity + – saurav04 asked Dec 20, 2015 saurav04 251 views answer comment Share Follow See 1 comment See all 1 1 comment reply Tendua commented Dec 20, 2015 reply Follow Share In algorithm n! is a very large value that why we use approximation of log n , and the formula used for this is starling approximation formula. u can google it out. bothe the above result are derived from them . i don't know the proof yet. 1 votes 1 votes Please log in or register to add a comment.
