Content deleted Content added
→Online selection algorithm: elaborate and clean up |
m →References: reflist |
||
Line 106:
== References ==
{{reflist}}
{{refbegin}}
* [[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.
Line 111 ⟶ 113:
* [[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}}
==External links==
|