Tag asymptotics - This is page 4 - GeneraCodice

What is considered an asymptotic improvement for graph algorithms?

https://www.generacodice.com/en/articolo/2472017/what-is-considered-an-asymptotic-improvement-for-graph-algorithms
  asymptotics  -  runtime-analysis
cs.stackexchange cs.stackexchange

What is the upper and lower bound for $T(n) = T(\sqrt{n}) +3$, assuming that $T(n)$ is a constant for $n\leq 10$

https://www.generacodice.com/en/articolo/2470587/what-is-the-upper-and-lower-bound-for-t-n-t-sqrt-n-3-assuming-that-t-n-is-a-constant-for-n-leq-10
  asymptotics  -  algorithm-analysis
cs.stackexchange cs.stackexchange

Intuition of lower bound for finding the minimum of $n$ (distinct) elements is $n-1$ as dealt with in CLRS

https://www.generacodice.com/en/articolo/2470504/intuition-of-lower-bound-for-finding-the-minimum-of-n-distinct-elements-is-n-1-as-dealt-with-in-clrs
  algorithms  -  asymptotics  -  algorithm-analysis  -  runtime-analysis
cs.stackexchange cs.stackexchange

Best case “skew height” of an arbitrary tree

https://www.generacodice.com/en/articolo/2470484/best-case-skew-height-of-an-arbitrary-tree
  complexity-theory  -  asymptotics  -  binary-trees  -  dag
cs.stackexchange cs.stackexchange

Is it correct or incorrect to say that an input say $C$ causes an average run-time of an algorithm?

https://www.generacodice.com/en/articolo/2470366/is-it-correct-or-incorrect-to-say-that-an-input-say-c-causes-an-average-run-time-of-an-algorithm
  algorithms  -  asymptotics  -  algorithm-analysis  -  runtime-analysis
cs.stackexchange cs.stackexchange

Average number of exchanges during first partition stage in Quicksort

https://www.generacodice.com/en/articolo/2470328/average-number-of-exchanges-during-first-partition-stage-in-quicksort
  quicksort  -  asymptotics  -  algorithm-analysis
cs.stackexchange cs.stackexchange

Clarifying $\sum_{h=0}^{\lfloor lg(n)\rfloor}\lceil\frac{n}{2^{h+1}}\rceil O(h)=O(n\sum_{h=0}^{\lfloor lg(n)\rfloor}\frac{h}{2^h})$ in BUILD-MAX-HEAP

https://www.generacodice.com/en/articolo/2470284/clarifying-sum-h-0-lfloor-lg-n-rfloor-lceil-frac-n-2-h-1-rceil-o-h-o-n-sum-h-0-lfloor-lg-n-rfloor-frac-h-2-h-in-build-max-heap
  algorithms  -  asymptotics  -  algorithm-analysis  -  runtime-analysis  -  heaps
cs.stackexchange cs.stackexchange

Show that $O(\text{max}\{f(n),g(n)\})=O(f(n)+g(n))$

https://www.generacodice.com/en/articolo/2469009/show-that-o-text-max-f-n-g-n-o-f-n-g-n
  asymptotics  -  landau-notation
cs.stackexchange cs.stackexchange

Proving building a balanced BST out of sorted array is $\Theta(n)$

https://www.generacodice.com/en/articolo/2468692/proving-building-a-balanced-bst-out-of-sorted-array-is-theta-n
  induction  -  asymptotics  -  runtime-analysis  -  recurrence-relation
cs.stackexchange cs.stackexchange

What do we mean by polynomially upper bounded and lower bounded

https://www.generacodice.com/en/articolo/2468386/what-do-we-mean-by-polynomially-upper-bounded-and-lower-bounded
  algorithms  -  asymptotics
cs.stackexchange cs.stackexchange
Results found: 1089
scroll top