标签average-case - 这是页4 - GeneraCodice

Average depth of a Binary Search Tree and AVL Tree

https://www.generacodice.com/cn/articolo/1558928/average-depth-of-a-binary-search-tree-and-avl-tree
  data-structures  -  average-case  -  algorithm-analysis  -  search-trees  -  balanced-search-trees
cs.stackexchange cs.stackexchange

Why does this mergesort variant not do Θ(n) comparisons on average?

https://www.generacodice.com/cn/articolo/1543725/why-does-this-mergesort-variant-not-do-Θ-n-comparisons-on-average
  sorting  -  average-case  -  algorithm-analysis  -  runtime-analysis
cs.stackexchange cs.stackexchange

Average Time Complexity of Searching An Array [closed]

https://www.generacodice.com/cn/articolo/1535502/average-time-complexity-of-searching-an-array-closed
  average-case  -  algorithm-analysis  -  runtime-analysis
cs.stackexchange cs.stackexchange

Asymptotic expected runtime of Randomized Algorithm

https://www.generacodice.com/cn/articolo/1530469/asymptotic-expected-runtime-of-randomized-algorithm
  algorithms  -  average-case  -  algorithm-analysis  -  runtime-analysis  -  randomized-algorithms
cs.stackexchange cs.stackexchange

Where would someone find amortized analysis more useful than average analysis and the opposite?

https://www.generacodice.com/cn/articolo/1527590/where-would-someone-find-amortized-analysis-more-useful-than-average-analysis-and-the-opposite
  amortized-analysis  -  average-case  -  algorithm-analysis
cs.stackexchange cs.stackexchange

Proving that the average case complexity of binary search is O(log n)

https://www.generacodice.com/cn/articolo/1527580/proving-that-the-average-case-complexity-of-binary-search-is-o-log-n
  binary-search  -  time-complexity  -  algorithms  -  average-case
cs.stackexchange cs.stackexchange

Understanding Expected Running Time of Randomized Algorithms

https://www.generacodice.com/cn/articolo/1510130/understanding-expected-running-time-of-randomized-algorithms
  time-complexity  -  probability-theory  -  algorithms  -  average-case  -  randomized-algorithms
cs.stackexchange cs.stackexchange

Find $k$ subsets containing a particular element quickly

https://www.generacodice.com/cn/articolo/1496521/find-k-subsets-containing-a-particular-element-quickly
  data-structures  -  hash  -  average-case  -  reference-request  -  sets
cs.stackexchange cs.stackexchange

Genetic algorithm: What is the expected number of strings that are explored?

https://www.generacodice.com/cn/articolo/1491024/genetic-algorithm-what-is-the-expected-number-of-strings-that-are-explored
  optimization  -  algorithms  -  average-case  -  genetic-algorithms
cs.stackexchange cs.stackexchange

跟踪$ k $最小整数的复杂性

https://www.generacodice.com/cn/articolo/1127832/跟踪-k-最小整数的复杂性
  algorithms  -  average-case  -  algorithm-analysis  -  runtime-analysis
cs.stackexchange cs.stackexchange
发现结果: 62
scroll top