Content deleted Content added
Line 684:
- Knuth, D. E. (1976). Big Omicron and big Omega and big Theta. ''ACM SIGACT News'', 8(2), 18-24.
}}
:::-'''''[[User:Esquivalience|<span style="color: #33BBFF; font-family:Lato, monospace'">Esquivalience</span>]]'' <sup>[[User talk:Esquivalience|<span style="color:#00B88A;">t</span>]]</sup>''' 22:29, 16 February 2016 (UTC)
::: Well we should just think about what is important for sorts. Best cases of algorithms actually refer to Ω(f(n)), while worst cases refer to O(f(n)), and average case refers to some heuristics, which were made based on all possible inputs. But what is important for the algorithm is for it to be as fast as possible in worst possible case, so O(f(n)) is the only one in practical use for computer algorithms. And even though in tables we can mention that best cases are Ω(f(n)), this information is redundant and not relevant to the subject of the article. [[User:Trimutius|Trimutius]] ([[User talk:Trimutius|talk]]) 20:47, 17 February 2016 (UTC)
| |||