Revision as of 00:39, 30 March 2023 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,684 edits dup ← Previous edit		Revision as of 00:40, 30 March 2023 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,684 edits →Further reading: dup Next edit →
Line 142: * {{Cite journal \| last1 = Kiwiel \| first1 = K. C. \| doi = 10.1016/j.tcs.2005.06.032 \| title = On Floyd and Rivest's SELECT algorithm \| journal = Theoretical Computer Science \| volume = 347 \| pages = 214–238 \| year = 2005 \| issue = 1–2 \| doi-access = free }} * [[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. {{refend}}

Selection algorithm: Difference between revisions