Revision as of 10:08, 1 December 2015 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Usage of bigO notation. "At least O(...)" ← Previous edit		Revision as of 14:58, 3 December 2015 edit undo Trimutius (talk \| contribs) 281 edits →Usage of bigO notation. "At least O(...)" Next edit →
Line 673: ::::That would be a good way of stating the claim, but it's still a classical theorem that I think should be stated as precisely as CLRS state it as well. [[User:Qwertyus\|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus\|hm?]])</small> 10:08, 1 December 2015 (UTC) ::::Just a little comment about "at least nlogn comparisons" suggestion. This just doesn't work, because actually it is "at least Cnlogn comparisons" where C is unknown constant. So to say number of operations is proportional to nlogn in worst case scenario (rather than bounded by this exact number), which basically is the meaning on O(nlogn) notation. [[User:Trimutius\|Trimutius]] ([[User talk:Trimutius\|talk]]) 14:57, 3 December 2015 (UTC)

Talk:Sorting algorithm: Difference between revisions