Revision as of 10:28, 25 August 2013 edit Nbarth (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 35,278 edits →References: see also (related but not strictly selection) ← Previous edit		Revision as of 13:24, 26 August 2013 edit undo Nbarth (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 35,278 edits m →References: cite doi Next edit →
Line 111: {{reflist}} {{refbegin}} * {{cite doi\|10.1016/S0022-0000(73)80033-9}} * [[Manuel Blum\|M. Blum]], [[Robert Floyd\|R.W. Floyd]], [[Vaughan Ronald Pratt\|V. Pratt]], [[Ron Rivest\|R. Rivest]] and [[Robert Tarjan\|R. Tarjan]], "Time bounds for selection," ''J. Comput. System Sci''. 7 (1973) 448-461. * K. C. Kiwiel. On Floyd and Rivest’s SELECT Algorithm, ''Theoretical Computer Sci.'' 347 (2005) 214-238. * [[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.

Selection algorithm: Difference between revisions