Talk:Sorting algorithm: Difference between revisions

Revision as of 23:25, 30 November 2015

Revision as of 23:27, 30 November 2015

Line 662:

::: It's true in the worst case, but it doesn't seem right to me. I don't like putting quantification monikers on order statistics that have lower and upper bounds built into them.

::: To put it another way, I can use Ω(), Θ(), and O() to characterize heap and bubble sort:

::::* Heap sort: Θ(nlogn)

::::* Bubble sort: Ω(n) and O(n²)

::: Those statements make sense as complexity theory lower (best case) and upper (worst case) bounds.

::: In that context, a claim that comparison sorts are Ω(nlogn) is confusing.