Tag big-o-notation - Это страница 14 - GeneraCodice

How to calculate Big O of $T(n) = aT(n^b) + f(n)$?

https://www.generacodice.com/ru/articolo/1613648/how-to-calculate-big-o-of-t-n-at-n-b-f-n
  complexity-theory  -  time-complexity  -  big-o-notation
cs.stackexchange cs.stackexchange

What does “bounded above” mean in Family of Bachmann–Landau notations?

https://www.generacodice.com/ru/articolo/1612811/what-does-bounded-above-mean-in-family-of-bachmann-landau-notations
  terminology  -  algorithms  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

Are “of the order of n” and “Big O” the same thing?

https://www.generacodice.com/ru/articolo/1612727/are-of-the-order-of-n-and-big-o-the-same-thing
  terminology  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

Are there variations of the regular runtimes of the Big-O-Notation?

https://www.generacodice.com/ru/articolo/1612566/are-there-variations-of-the-regular-runtimes-of-the-big-o-notation
  optimization  -  complexity-theory  -  time-complexity  -  big-o-notation
cs.stackexchange cs.stackexchange

What should I call algorithms with non-linear non-constant time?

https://www.generacodice.com/ru/articolo/1612539/what-should-i-call-algorithms-with-non-linear-non-constant-time
  complexity-theory  -  terminology  -  time-complexity  -  runtime-analysis  -  big-o-notation
cs.stackexchange cs.stackexchange

Asymptotics question

https://www.generacodice.com/ru/articolo/1611456/asymptotics-question
  factorial  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

How to find the big o running time if the recursion function have different cases of recursion with different fraction of n?

https://www.generacodice.com/ru/articolo/1609590/how-to-find-the-big-o-running-time-if-the-recursion-function-have-different-cases-of-recursion-with-different-fraction-of-n
  runtime-analysis  -  recurrence-relation  -  big-o-notation
cs.stackexchange cs.stackexchange
Результаты найдены: 145
scroll top