2020-12-24

## asymptotics – Is there a function that grows faster than exponentially but slower than a factorial?

The Question : 123 people think this question is useful 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 $\dfrac{f(n)}{g(n)}$ goes to zero in the limit as $n$ goes to infinity. Is there any known