performance - What is "n nought" in terms of "big O"? -


i wondering term "n not", written n (subscript) 0, is. useful when proving big 0. believe "n not" determined after c.

i trying prove 2^n = o(n!). c , "n not" in case? why?

edit: i'd mention know big o on high level. understand 2^n = o(n!) means , know why it's true. i'm not @ writing proofs asymptotic notation.


Comments

Popular posts from this blog

javascript - WinJS appendTextAsync producing scheduler errors -

minify - Minimizing css files -

Sockets with kotlin -