Is there a function that grows faster than exponentially but slower than a factorial? – math.stackexchange.com

In big-O notation the complexity class $O(2^n)$ is named “exponential”. The complexity class $O(n!)$ is named “factorial”.

I believe that $f(n) = O(2^n)$ and $g(n) = O(n!)$ means that $f(n)/g(n)$ …

For Get Answer – Click here

Leave a Reply

Your email address will not be published. Required fields are marked *