Asymptotic comparison of functions -


I want to compare the following functions asymptotically and then want to arrange them in ascending order. Can anyone help me out? A reasonable explanation is LG ((รข ???? N)!), LG (SquareRoot (EN!)), SquareRoot (N!), (LG), (SquareRoot (LG N)) !, SquareRoot (LG N)! Thank you

If you think about "general solution" and you There are a number of supplemental functions that are in comparison with what I recommend:

Use, once you know:

  f (n) = o (g (N)) Iff limit (n approach + inf) f (n) / g (n) is present and is not + INF   

You can use, for example OpenSource, Here it is.

Then, LG (n) * LG (n) = O (SQL) (n)) can be (LG) LG (N) / STRR (N) limit is set :

  (% i1) boundary ((log (n) ^ 2) / (sqrt (n)), n, inf) ; (% O1) 0   

If you want more descriptive notation:

  (% i1) f (n): = log (n) ^ 2 ; 2 (% o1) f (n): = log (n) (% i2) g (n): = sqrt (n); (% O2) g (n): = sqrt (n) (% i3) range (f (n) / g (n), n, inf); (% O3) 0    

Comments

Popular posts from this blog

mysql - BLOB/TEXT column 'value' used in key specification without a key length -

c# - Using Vici cool Storage with monodroid -

python - referencing a variable in another function? -