Content deleted Content added
Line 703:
:::: As it turns out, the order notation is inadequate for what you want to say here. It also adds confusion rather than clarifies.
:::: [[User:Glrx|Glrx]] ([[User talk:Glrx|talk]]) 02:47, 18 February 2016 (UTC)
: I'm not really sure what the talk is about? It is pretty obvious that in all referenced literature they use Big O Notation for a particular reason. Because Ω just isn't really important. In all other cases where "upper bound" (or "worst case"), though looking at the current state of article this notation is used for average cases for some reason in many cases.
: Phrases like "average time complexity of O(n log n)" just don't make sense, and there are at least couple of places where it states that. I'm against using Ω though, because that one isn't related to. We need some kind of alternative. For example just simply saying with words rather than notation: "average time complexity proportional to ''n''log''n''". Because that what people are basically trying to say.
[[User:Trimutius|Trimutius]] ([[User talk:Trimutius|talk]]) 22:26, 19 February 2016 (UTC)
| |||