Content deleted Content added
→Usage of bigO notation. "At least O(...)": close sup tag |
|||
Line 664:
:::* Heap sort: Θ(nlogn)
:::* Bubble sort: Ω(n) and O(n<sup>2</sup>)
::: Those statements make sense as complexity theory lower (best case) and upper (worst case) bounds. And I don't have to add "best" or "worst" monikers.
::: In that context, a claim that comparison sorts are Ω(nlogn) is confusing.
::: I don't see the same confusion with a statement that a comparison sort cannot be better than O(nlogn).
| |||