Revision as of 14:16, 26 August 2013 edit Nbarth (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 35,278 edits →Language support: Range queries ← Previous edit		Revision as of 14:53, 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 115: {{refbegin}} * {{cite doi\|10.1016/S0022-0000(73)80033-9}} * {{cite doi\|10.1016/j.tcs.2005.06.032}} * 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. * [[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.

Selection algorithm: Difference between revisions