Revision as of 23:28, 30 November 2015 edit Glrx (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 29,708 edits →Usage of bigO notation. "At least O(...)" ← Previous edit		Revision as of 23:29, 30 November 2015 edit undo Glrx (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 29,708 edits →Usage of bigO notation. "At least O(...)": ... mind ... does ... not ... work ... today Next edit →
Line 667: ::: 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). ::: Perhaps the best way out is to avoid order ~~notaiton~~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)

Talk:Sorting algorithm: Difference between revisions