Revision as of 08:23, 1 December 2015 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Usage of bigO notation. "At least O(...)": point out imprecision ← Previous edit		Revision as of 10:08, 1 December 2015 edit undo Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Usage of bigO notation. "At least O(...)" Next edit →
Line 671: ::: Perhaps the best way out is to avoid order notation and just say comparison sorts require at least nlogn comparisons for some inputs. ::: [[User:Glrx\|Glrx]] ([[User talk:Glrx\|talk]]) 23:25, 30 November 2015 (UTC) ::::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)

Talk:Sorting algorithm: Difference between revisions