Revision as of 23:36, 17 September 2022 edit Natg 19 (talk \| contribs) Extended confirmed users 198,670 edits fix ref link ← Previous edit		Revision as of 19:46, 28 March 2023 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits →Bibliography: I don't think any material here still resembles the DADS link Next edit →
Line 120: * [[Donald Knuth]]. ''[[The Art of Computer Programming]]'', Volume 3: ''Sorting and Searching'', Third Edition. Addison-Wesley, 1997. {{ISBN\|0-201-89685-0}}. Section 5.3.3: Minimum-Comparison Selection, pp. 207–219. * [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw-Hill, 2001. {{ISBN\|0-262-03293-7}}. Chapter 9: Medians and Order Statistics, pp. 183–196. Section 14.1: Dynamic order statistics, pp. 302–308. * {{DADS\|Select\|select}} {{refend}}

Selection algorithm: Difference between revisions