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

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

19:07 No Comments
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)$ ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

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

Post a Comment

Subscribe to: Post Comments (Atom)