Revision as of 10:27, 25 August 2013 edit Nbarth (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 35,278 edits m →Using data structures to select in sublinear time: wording ← Previous edit		Revision as of 10:28, 25 August 2013 edit undo Nbarth (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 35,278 edits →References: see also (related but not strictly selection) Next edit →
Line 104: Because [[sorting algorithm#Language support\|language support for sorting]] is more ubiquitous, the simplistic approach of sorting followed by indexing is preferred in many environments despite its disadvantage in speed. Indeed for [[Lazy evaluation\|lazy languages]], this simplistic approach can even achieve the best complexity possible for the ''k'' smallest/greatest sorted (with maximum/minimum as a special case) if the sort is lazy enough. == See also == * [[Ordinal optimization]] == References ==

Selection algorithm: Difference between revisions